Particle swarm optimization for the continuous p-median problem

  • Authors:

  • Julio Brito;Francisco J. Martínez;José A. Moreno

  • Affiliations:

  • Departmento de Estadtica, I.O. y Computación, Instituto Universitario de Desarrollo General, Universidad de La Laguna, La Laguna, Spain;Departmento de Estadtica, I.O. y Computación, Instituto Universitario de Desarrollo General, Universidad de La Laguna, La Laguna, Spain;Departmento de Estadtica, I.O. y Computación, Instituto Universitario de Desarrollo General, Universidad de La Laguna, La Laguna, Spain

  • Venue:
  • CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.