The orienteering problem: A survey

European Journal of Operational Research

Volumn 209, Issue 1, 2011, Pages 1-10

  Vansteenwegen, Pieter ^a   Souffriau, Wouter ^a,b   Oudheusden, Dirk Van ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b ODISEE UNIVERSITY COLLEGE   (Belgium)

Author keywords

Combinatorial optimisation; Orienteering problem; Survey

Indexed keywords

COMBINATORIAL OPTIMIZATION; SURVEYING;

EXACT SOLUTION; ITS APPLICATIONS; ORIENTEERING PROBLEM; RESEARCH QUESTIONS;

SURVEYS;

EID: 78649467505     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.03.045     Document Type: Review

References (64)

1. J. Aráoz, E. Fernández, and O. Meza Solving the prize-collecting rural postman problem European Journal of Operational Research 196 2009 886 896
2. C. Archetti, D. Feillet, A. Hertz, and M. Speranza The capacitated team orienteering and profitable tour problems Journal of the Operational Research Society 60 2009 831 842
3. Archetti, C., Feillet, D., Hertz, A., Speranza, M. in press. The undirected capacitated arc routing problem with profits. Computers and Operations Research. doi: 10.1016/j.cor.2009.05.005.
4. C. Archetti, A. Hertz, and M. Speranza Metaheuristics for the team orienteering problem Journal of Heuristics 13 2007 49 76
5. Arkin, E., Mitchell, J., Narasimhan, G. 1998. Resource-constrained geometric network optimisation. In: Proc. 14th ACM Symposium on Computational Geometry, June, pp. 307-316.
6. R. Bar-Yehuda, G. Even, and S. Shahar On approximating a geometric prize-collecting travelling salesman problem with time windows Journal of Algorithms 55 1 2005 76 92
7. J.F. Bérubé, M. Gendreau, and J.Y. Potvin An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits European Journal of Operational Research 194 2009 39 50
8. S. Boussier, D. Feillet, and M. Gendreau An exact algorithm for the team orienteering problem 4OR 5 2007 211 230
9. S. Butt, and T. Cavalier A heuristic for the multiple tour maximum collection problem Computers and Operations Research 21 1994 101 111
10. S. Butt, and D. Ryan An optimal solution procedure for the multiple tour maximum collection problem using column generation Computers and Operations Research 26 1999 427 441
11. Chao, I. 1993. Algorithms and solutions to multi-level vehicle routing problems. Ph.D. Dissertation, Applied Mathematics Program, University of Maryland, College Park, USA.
12. I. Chao, B. Golden, and E. Wasil Theory and methodology - the team orienteering problem European Journal of Operational Research 88 1996 464 474
13. I. Chao, B. Golden, and E. Wasil Theory and methodology - a fast and effective heuristic for the orienteering problem European Journal of Operational Research 88 1996 475 489
14. J.-F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
15. D. Feillet, P. Dejax, and M. Gendreau Travelling salesman problems with profits Transportation Science 39 2005 188 205
16. D. Feillet, P. Dejax, and M. Gendreau The profitable arc tour problem: Solution with a branch-and-price algorithm Transportation Science 39 2005 539 552
17. M. Fischetti, J. Salazar, and P. Toth Solving the orienteering problem through branch-and-cut INFORMS Journal on Computing 10 1998 133 148
18. F. Fomin, and A. Lingas Approximation algorithms for time-dependent orienteering Information Processing Letters 83 2002 57 62
19. Gendreau, M., Laporte, G., Semet, F. 1995. A branch-and-cut algorithm for the undirected selective travelling salesman problem. Publication CRT-95-80, Centre de recherche sur les transports, Montreal, Canada.
20. M. Gendreau, G. Laporte, and F. Semet A tabu search heuristic for the undirected selective travelling salesman problem European Journal of Operational Research 106 1998 539 545 (Pubitemid 128399667)
21. M. Gendreau, G. Laporte, and F. Semet A branch-and-cut algorithm for the undirected selective travelling salesman problem Networks 32 1998 263 273 (Pubitemid 128365136)
22. B. Golden, L. Levy, and R. Vohra The orienteering problem Naval Research Logistics 34 1987 307 318
23. B. Golden, Q. Wang, and L. Liu A multifaceted heuristic for the orienteering problem Naval Research Logistics 35 1988 359 366
24. Harvey, W., Ginsberg, M. 1995. Limited discrepancy search. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Morgan Kaufman, Montréal, pp. 607-615.
25. T. Ilhan, S. Iravani, and M. Daskin The orienteering problem with stochastic profits IIE Transactions 40 2008 406 421
26. M. Kantor, and M. Rosenwein The orienteering problem with time windows The Journal of the Operational Research Society 43 6 1992 629 635
27. S. Kataoka, and S. Morito An algorithm for the single constraint maximum collection problem Journal of the Operations Research Society of Japan 31 4 1988 515 530
28. L. Ke, C. Archetti, and Z. Feng Ants can solve the team orienteering problem Computers and Industrial Engineering 54 2008 648 665
29. C. Keller Algorithms to solve the orienteering problem: A comparison European Journal of Operational Research 41 1989 224 231
30. G. Laporte, and S. Martello The selective travelling salesman problem Discrete Applied Mathematics 26 1990 193 207
31. G. Laporte, and I. Rodriguez Martin Locating a cycle in a transportation or a telecommunications network Networks 2007 92 108
32. A. Leifer, and M. Rosenwein Strong linear programming relaxations for the orienteering problem European Journal of Operational Research 73 1994 517 523
33. Liang, Y., Kulturel-Konak, S., Smith, A. 2002. Meta heuristics for the orienteering problem. In: Proceedings of the 2002 Congress on Evolutionary Computation. Hawaii, Honolulu, pp. 384-389.
34. S. Lin Computer solutions of the traveling salesman problem Bell System Technical Journal 44 1965 2245 -2269
35. Mansini, R., Pelizzari, M., Wolfer, R. 2006. A granular variable neighbourhood search heuristic for the tour orienteering problem with time windows. Technical Report R.T 2006-02-52, University of Brescia, Italy.
36. C. Miller, A. Tucker, and R. Zemlin Integer programming formulations and travelling salesman problems Journal of the ACM 7 1960 326 329
37. R. Montemanni, and L. Gambardella Ant colony system for team orienteering problems with time windows Foundations of computing and Decision Sciences 34 4 2009 287 306
38. L. Muyldermans, P. Beullens, D. Cattrysse, and D. Van Oudheusden Exploring variants of 2- and 3-opt for the general routing problem Operations Research 53 6 2005 982 995
39. Pekny, J., Miller, D. 1990. An exact parallel algorithm for the resource constrained travelling salesman problem with application to scheduling with an aggregate deadline. In: Proceedings of the 1990 ACM Annual Conference on Cooperation, Washington, DC, USA, pp. 208-214.
40. R. Ramesh, and K. Brown An efficient four-phase heuristic for the generalized orienteering problem Computers and Operations Research 18 1991 151 165
41. R. Ramesh, Y. Yoon, and M. Karwan An optimal algorithm for the orienteering tour problem ORSA Journal on Computing 4 1992 155 165
42. Righini, G., Salani, M. 2006. Dynamic programming for the orienteering problem with time windows. Technical Report 91 2006, Dipartimento di Tecnologie dell'Informazione, Universita degli Studi Milano, Crema, Italy.
43. G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path Networks 51 3 2008 155 170
44. G. Righini, and M. Salani Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming Computers & Operations Research 4 2009 1191 1203
45. M. Schilde, K. Doerner, R. Hartl, and G. Kiechle Metaheuristics for the bi-objective orienteering problem Swarm Intelligence 3 2009 179 201
46. M. Solomon Algorithms for the vehicle routing and scheduling problem with time window constraints Operations Research 35 1987 254 265
47. Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, G. in press. A path relinking approach for the team orienteering problem. Computers and Operations Research, doi: 10.1016/j.cor.2009.05.002.
48. W. Souffriau, P. Vansteenwegen, J. Vertommen, G. Vanden Berghe, and D. Van Oudheusden A personalised tourist trip design algorithm for mobile tourist guides Applied Artificial Intelligence 22 10 2008 964 985
49. H. Tang, and E. Miller-Hooks A tabu search heuristic for the team orienteering problem Computer and Operations Research 32 2005 1379 1407
50. M. Tasgetiren A genetic algorithm with an adaptive penalty function for the orienteering problem Journal of Economic and Social Research 4 2 2001 1 26
51. Thomadsen, T., Stidsen, T. 2003. The quadratic selective travelling salesman problem. Informatics and Mathematical Modelling Technical Report 2003-17, Technical University of Denmark.
52. F. Tricoire, M. Romauch, K. Doerner, and R. Hartl Heuristics for the multi-period orienteering problem with multiple time windows Computers and Operations Research 37 2 2010 351 367
53. T. Tsiligirides Heuristic methods applied to orienteering Journal of the Operational Research Society 35 9 1984 797 809
54. Vansteenwegen, P. 2008. Planning in tourism and public transportation - attraction selection by means of a personalised electronic tourist guide and train transfer scheduling. Ph.D. Dissertation, Katholieke Universiteit Leuven, Centre for Industrial Management, Belgium, ISBN: 978-90-5682-949-0.
55. P. Vansteenwegen, W. Souffriau, and D. Van Oudheusden A detailed analysis of two metaheuristics for the team orienteering problem T. Stützle, M. Birattari, H. Hoos, Engineering Stochastic Local Search Lecture Notes in Computer Science vol. 5752 2009 Springer Berlin 110 114
56. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden A guided local search metaheuristic for the team orienteering problem European Journal of Operational Research 196 1 2009 118 127
57. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden Metaheuristics for tourist trip planning M. Geiger, W. Habenicht, M. Sevaux, K. Sörensen, Metaheuristics in the Service Industry Lecture Notes in Economics and Mathematical Systems vol. 624 2009 Springer-Verlag 15 31
58. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden Iterated local search for the team orienteering problem with time windows Computers and Operations Research 36 12 2009 3281 3290
59. P. Vansteenwegen, and D. Van Oudheusden The mobile tourist guide: An or opportunity OR Insights 20 3 2007 21 27
60. Q. Wang, X. Sun, B. Golden, and J. Jia Using artificial neural networks to solve the orienteering problem Annals of Operations Research 61 1995 111 120
61. Q. Wang, X. Sun, and B. Golden Using artificial neural networks to solve generalized orienteering problems C. Dagli, M. Akay, C. Chen, B. Fernández, J. Ghosh, Intelligent Engineering Systems Through Artificial Neural Networks vol. 6 1996 ASME Press New York 063 1068
62. Wang, X., Golden, B., Wasil, E. 2008. Using a genetic algorithm to solve the generalized orienteering problem. In: Golden, B., Raghavan, S., Wasil, E. (Eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 263-274.
63. A. Wren, and A. Holliday Computer scheduling of vehicles from one or more depots to a number of delivery points Operational Research Quarterly 23 1972 333 344
64. G. Zong, C.-L. Tseng, and Y. Park Harmony search for generalized orienteering problem: Best touring in China Advances in Natural Computation 2005 741 750