New heuristic algorithms for solving the planar p-median problem

Zvi Drezner , Jack Brimberg , Nenad Mladenovic (1) , Said Salhi (2)

1 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201
2 UK - University of Kentucky

In this paper we propose effective heuristics for the solution of the planar p-median problem. We develop a new distribution based variable neighborhood search and a new genetic algorithm, and also test a hybrid algorithm that combines these two approaches. The best results were obtained by the hybrid approach. The best known solution was found in 466 out of 470 runs, and the average solution was only 0.000016% above the best known solution on 47 well explored test instances of 654 and 1060 demand points and up to 150 facilities.

Mots clés: "Location analysis"; "Planar p-median"; "Multi-source Weber problem"; "Variable neighborhood search"; "Genetic algorithm"

Domaines: Informatique [cs]

Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Said Salhi. New heuristic algorithms for solving the planar p-median problem. Computers and Operations Research, 2015, 62, pp.296-304. ⟨10.1016/j.cor.2014.05.010⟩. ⟨hal-03401097⟩