New heuristic algorithms for solving the planar p-median problem
New heuristic algorithms for solving the planar p-median problem
复制标题
DOI：
10.1016/j.cor.2014.05.010
复制
发表时间：
2015-10
期刊：
影响因子：
--
通讯作者：
Z. Drezner;J. Brimberg;N. Mladenović;S. Salhi
中科院分区：
文献类型：
--
作者：
Z. Drezner;J. Brimberg;N. Mladenović;S. Salhi
In this paper we propose effective heuristics for the solution of the planarp-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.
