Title
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.
Year
DOI
Venue
2015
10.1016/j.cor.2014.05.010
Computers & Operations Research
Keywords
Field
DocType
Location analysis,Planar p-median,Multi-source Weber problem,Variable neighborhood search,Genetic algorithm
Mathematical optimization,Heuristic,Hybrid algorithm,Variable neighborhood search,Algorithm,Heuristics,Planar,Mathematics,Genetic algorithm
Journal
Volume
ISSN
Citations 
62
0305-0548
14
PageRank 
References 
Authors
0.62
21
4
Name
Order
Citations
PageRank
Zvi Drezner11195140.69
Jack Brimberg258842.07
Nenad Mladenovic31882127.14
Said Salhi434226.38