A novel GRASP solution approach for the Orienteering Problem

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.

[1]  Charalampos Konstantopoulos,et al.  A survey on algorithmic approaches for solving tourist trip design problems , 2014, Journal of Heuristics.

[2]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[3]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[4]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[5]  T. Feo,et al.  Greedy Randomized Adaptive Search Procedures , 1995, Handbook of Metaheuristics.

[6]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[7]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[8]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[9]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

[10]  Daniele Vigo,et al.  Vehicle Routing Problems with Profits , 2014, Vehicle Routing.

[11]  Abraham Duarte,et al.  GRASP with path relinking for the orienteering problem , 2014, J. Oper. Res. Soc..

[12]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[13]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[14]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[15]  Bruce L. Golden,et al.  The effective application of a new approach to the generalized orienteering problem , 2010, J. Heuristics.

[16]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[17]  G. Laporte,et al.  A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem , 1998 .

[18]  G. V. Berghe,et al.  Metaheuristics for Tourist Trip Planning , 2009 .

[19]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[20]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.