An adaptive large neighbourhood search algorithm for the orienteering problem

作者：

Highlights：

• New heuristic based on Adaptive Large Neighbourhood Search.

• Uses a clustering of the input graph

• Extensive computational experiments on existing benchmarks.

• Compares favourably with heuristic algorithms from the literature.

摘要

•New heuristic based on Adaptive Large Neighbourhood Search.•Uses a clustering of the input graph•Extensive computational experiments on existing benchmarks.•Compares favourably with heuristic algorithms from the literature.

论文关键词：Orienteering problem,Metaheuristics,Clustering,Adaptive large neighbourhood search

论文评审过程：Received 3 July 2018, Revised 29 October 2018, Accepted 29 December 2018, Available online 14 January 2019, Version of Record 19 January 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.12.050