Decomposition Strategies for Large Scale Continuous Location-Allocation Problems

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 neighbourhood decomposition search heuristic and tested on large instances of this problem.

[1]  Nenad Mladenović,et al.  SOLVING THE CONTINUOUS LOCATION-ALLOCATION PROBLEM WITH TABU SEARCH , 1996 .

[2]  R. Love,et al.  Properties and Solution Methods for Large Location—Allocation Problems , 1982 .

[3]  Éric D. Taillard,et al.  Heuristic Methods for Large Centroid Clustering Problems , 2003, J. Heuristics.

[4]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[5]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[6]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[7]  Nenad Mladenovic,et al.  Degeneracy in the multi-source Weber problem , 1999, Math. Program..

[8]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[9]  L. Cooper.  Location-Allocation Problems , 1963 .

[10]  Saïd Salhi,et al.  A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem , 2003, Ann. Oper. Res..

[11]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[12]  Nenad Mladenović,et al.  A Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem , 1995 .

[13]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[14]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[15]  Pierre Hansen,et al.  How to Choose K Entities Among N , 1994, Partitioning Data Sets.

[16]  Pierre Hansen,et al.  Heuristic solution of the multisource Weber problem as a p-median problem , 1996, Oper. Res. Lett..

[17]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[18]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[19]  Christopher R. Houck,et al.  Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..