Particle swarm optimization for the continuous p-median problem

This work describes the application of the Particle Swarm Optimization (PSO) metaheuristic to the continuous version of the p-median problem. The problem consists in determining p points minimizing the weighted distance to a given set of points. This is an NP-hard problem and several evolutionary algorithms and other metaheuristics have been applied to solve it. We propose a new version of the PSO metaheuristic for this problem that takes into account the real meaning of the solution and that is combined with a Local Search. The proposed procedure is compared with the standard version of the PSO and its combination with the local search is compared with the Multi-Start method.

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

[2]  Zeinab Azarmand,et al.  Location Allocation Problem , 2009 .

[3]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

[5]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[6]  I. K. Altinel,et al.  Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps , 2006, J. Oper. Res. Soc..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Richard W. Cuthbertson,et al.  The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management , 1998, J. Oper. Res. Soc..

[9]  Ferman Cumhur,et al.  Theory Of The Location Of Industries , 1960 .

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

[11]  George O. Wesolowsky,et al.  THE WEBER PROBLEM: HISTORY AND PERSPECTIVES. , 1993 .

[12]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[13]  Saïd Salhi,et al.  A cellular heuristic for the multisource Weber problem , 2003, Comput. Oper. Res..

[14]  Claudio Barbieri da Cunha,et al.  The logic of logistics: theory, algorithms and applications for logistics management , 1999 .

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

[16]  Karolos M. Grigoriadis,et al.  Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics , 2005 .

[17]  Paul H. Calamai,et al.  A projection method forlp norm location-allocation problems , 1994, Math. Program..

[18]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..