A Rotary Heuristic for Location-Allocation Problems
No Thumbnail Available
Date
2017-10-16
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper proposes a constructive heuristic method to solve location-allocation problems. Specifically, we
consider the problem of locating m new facilities in a continuous region such that the sum of the weighted distances from
the new facilities to n existing facilities is minimized. The distance is measured using the Euclidean-distance metric. This
simple technique shows that the solution found is encouraging for the case where the number of users is much larger than
the number of facilities to be located
Description
Keywords
facility location, location-allocation, heuristic