Skip to Main content Skip to Navigation
Journal articles

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem

Abstract : A self-adaptive heuristic that incorporates a variable level of perturbation, a novel local search and a learning mechanism is proposed to solve the p-centre problem in the continuous space. Empirical results, using several large TSP-Lib data sets, some with over 1300 customers with various values of p, show that our proposed heuristic is both effective and efficient. This perturbation metaheuristic compares favourably against the optimal method on small size instances. For larger instances the algorithm outperforms both a multi-start heuristic and a discrete-based optimal approach while performing well against a recent powerful VNS approach. This is a self-adaptive method that can easily be adopted to tackle other combinatorial/global optimisation problems. For benchmarking purposes, the medium size instances with 575nodes are solved optimally for the first time, though requiring a large amount of computational time. As a by-product of this research, we also report for the first time the optimal solution of the vertex p-centre problem for these TSP-Lib data sets.
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 - 9:36:04 AM
Last modification on : Wednesday, November 3, 2021 - 5:22:09 AM

Links full text




Abdalla Elshaikh, Said Salhi, Jack Brimberg, Nenad Mladenovic, Becky Callaghan, et al.. An adaptive perturbation-based heuristic: An application to the continuous p-centre problem. Computers and Operations Research, Elsevier, 2016, 75, pp.1-11. ⟨10.1016/j.cor.2016.04.018⟩. ⟨hal-03400519⟩



Record views