Journal of Heuristics

, Volume 22, Issue 5, pp 699–726 | Cite as

A novel GRASP solution approach for the Orienteering Problem

Article
First Online:
Received:
Revised:
Accepted:

Abstract

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.

Keywords

Traveling Salesman Problem Orienteering Problem Heuristic GRASP 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgments

The authors would like to thank the authors of Fischetti et al. (1998) and Campos et al. (2014) for sharing their results.

References

  1. Archetti, C., Speranza, M.G., Vigo, D.: Vehicle Routing Problems with Profits. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods and Applications, MOS-SIAM Series on Optimization. SIAM, Philadelphia (2014)Google Scholar
  2. Campos, V., Martí, R., Sánchez-Oro, J., Duarte, A.: GRASP with path relinking for the orienteering problem. J. Oper. Res. Soc. 65(12), 1800–1813 (2014)Google Scholar
  3. Chao, I.M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88(3), 475–489 (1996a)CrossRefMATHGoogle Scholar
  4. Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996b)CrossRefMATHGoogle Scholar
  5. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995)MathSciNetCrossRefMATHGoogle Scholar
  6. Fischetti, M., González, J.J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2), 133–148 (1998)MathSciNetCrossRefMATHGoogle Scholar
  7. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G.: A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3), 291–328 (2014)CrossRefGoogle Scholar
  8. Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263–273 (1998a)MathSciNetCrossRefMATHGoogle Scholar
  9. Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(23), 539–545 (1998b)CrossRefMATHGoogle Scholar
  10. Laporte, G., Martello, S.: The selective travelling salesman problem. Discr. Appl. Math. 26(23), 193–207 (1990)MathSciNetCrossRefMATHGoogle Scholar
  11. Ramesh, R., Yoon, Y.S., Karwan, M.H.: An optimal algorithm for the orienteering tour problem. ORSA J. Comput. 4(2), 155–165 (1992)CrossRefMATHGoogle Scholar
  12. Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)MathSciNetCrossRefMATHGoogle Scholar
  13. Schilde, M., Doerner, K., Hartl, R., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3(3), 179–201 (2009)CrossRefGoogle Scholar
  14. Silberholz, J., Golden, B.: The effective application of a new approach to the generalized orienteering problem. J. Heuristics 16(3), 393–415 (2010)CrossRefMATHGoogle Scholar
  15. Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379–1407 (2005)CrossRefMATHGoogle Scholar
  16. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)CrossRefGoogle Scholar
  17. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Metaheuristics for tourist trip planning. In: Sörensen, K., Sevaux, M., Habenicht, W., Geiger, M.J. (eds.) Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol. 624, pp. 15–31. Springer, Berlin (2009)CrossRefGoogle Scholar
  18. Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringShiraz UniversityShirazIran

Personalised recommendations