Decomposition Strategies for Large Scale Continuous Location-Allocation Problems

, , and

BibTeX reference

The continuous location-allocation problem requires finding sites for m new facilities in the plane in order to serve n users such that the total transportation costs are minimized. Several heuristics have been developed to solve this well-studied global optimization problem. However, little work has been done using decomposition techniques. In this paper, we examine a few new ways to decompose the location-allocation problem. These strategies are then embedded in a variable neighborhood decomposition search heuristic and tested on large instances of this problem.

, 13 pages

Research Axis

Research applications


Decomposition strategies for large scale continuous location-allocation problems
, , and
IMA Journal of Management Mathematics, 17(4), 307–316, 2006 BibTeX reference