Skip to Main content Skip to Navigation
Journal articles

New heuristic algorithms for solving the planar p-median problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 11:40:16 AM
Last modification on : Tuesday, August 30, 2022 - 5:04:23 PM

Links full text




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



Record views