Authors: Drezner, Zvi
Brimberg, Jack
Mladenović, Nenad 
Salhi, Said
Title: New heuristic algorithms for solving the planar p-median problem
Journal: Computers and Operations Research
Volume: 62
First page: 296
Last page: 304
Issue Date: 28-Jul-2015
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.05.010
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.
Keywords: Genetic algorithm | Location analysis | Multi-source Weber problem | Planar p-median | Variable neighborhood search
Publisher: Elsevier
Project: Natural Sciences and Engineering Research Council of Canada Discovery Grant (NSERC #205041-2008)
UK Research Council EPSRC(EP/I009299/1)
Serbian Ministry of Sciences, Grant no. 144010

Show full item record


checked on Jun 11, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.