Journal
JOURNAL OF HEURISTICS
Volume 22, Issue 5, Pages 699-726Publisher
SPRINGER
DOI: 10.1007/s10732-016-9316-7
Keywords
Traveling Salesman Problem; Orienteering Problem; Heuristic; GRASP
Ask authors/readers for more resources
The Orienteering Problem (OP) is a well-known variant of the Traveling Salesman Problem. In this paper, a novel Greedy Randomized Adaptive Search Procedure (GRASP) solution is proposed to solve the OP. The proposed method is shown to outperform state-of-the-art heuristics for the OP in producing high quality solutions. In comparison with the best known solutions of standard benchmark instances, the method can find the optimal or the best known solution of about 70 % of the instances in a reasonable time, which is about 17 % better than the best known approach in the literature. Moreover, a significant improvement is achieved on the solution of two standard benchmark instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available