A guided local search metaheuristic for the team orienteering problem

European Journal of Operational Research

Volumn 196, Issue 1, 2009, Pages 118-127

  Vansteenwegen, Pieter ^a   Souffriau, Wouter ^a,b   Berghe, Greet Vanden ^b   Oudheusden, Dirk Van ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b ODISEE UNIVERSITY COLLEGE   (Belgium)

Author keywords

Guided local search; Metaheuristics; Orienteering problem

Indexed keywords

HEURISTIC ALGORITHMS; ONLINE SEARCHING;

COMPUTATIONAL TIMES; FIXED NUMBERS; GUIDED LOCAL SEARCH; GUIDED LOCAL SEARCHES; LOCAL SEARCH HEURISTICS; METAHEURISTIC; METAHEURISTICS; ORIENTEERING PROBLEM; ORIENTEERING PROBLEMS; PROMISING TECHNIQUES; SOLUTION SPACES;

HEURISTIC METHODS;

EID: 56549084034     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.02.037     Document Type: Article

References (27)

1. Archetti C., Hertz A., and Speranza M. Metaheuristics for the team orienteering problem. Journal of Heuristics 13 (2007) 49-76
2. Arkin, E., Mitchell, J., Narasimhan, G., 1998. Resource-constrained geometric network optimization. In: Proceedings of the 14th ACM Symposium on Computational Geometry, pp. 307-316.
3. Beullens P., Muyldermans L., Cattrysse D., and Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 (2003) 629-643
4. Butt S., and Cavalier T. A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 21 (1994) 101-111
5. Chao, I., 1993. Algorithms and solutions to multi-level vehicle routing problems. Ph.D. Dissertation, Applied Mathematics Program, University of Maryland, College Park, USA.
6. Chao I., Golden B., and Wasil E. The team orienteering problem. European Journal of Operational Research 88 (1996) 464-474
7. Chao I., Golden B., and Wasil E. A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88 (1996) 475-489
8. Feillet D., Dejax P., and Gendreau M. Travelling salesman problems with profits. Transportation Science 39 (2005) 188-205
9. Fischetti M., Salazar J., and Toth P. Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10 (1998) 133-148
10. Gendreau M., Laporte G., and Semet F. A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research 106 (1998) 539-545
11. Gendreau M., Laporte G., and Semet F. A branch-and-cut algorithm for the undirected selective travelling salesman problem. Networks 32 (1998) 263-273
12. Golden B., Levy L., and Vohra R. The orienteering problem. Naval Research Logistics 34 (1987) 307-318
13. Golden B., Wang Q., and Liu L. A multifaceted heuristic for the orienteering problem. Naval Research Logistics 35 (1988) 359-366
14. Hansen P., and Mladenovic N. Variable neighbourhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
15. Kilby, P., Prosser, P., Shaw, P., 1997. Guided local search for the vehicle routing problem. In: Proceedings of the Second International Conference on Meta-heuristics.
16. Laporte G., and Martello S. The selective travelling salesman problem. Discrete Applied Mathematics 26 (1990) 193-207
17. Miller C., Tucker A., and Zemlin R. Integer programming formulations and travelling salesman problems. Journal of the ACM 7 (1960) 326-329
18. Mills P., Tsang E., and Ford J. Applying an extended guided local search to the quadratic assignment problem. Annals of Operations Research 118 (2003) 121-135
19. 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.
20. Ramesh R., and Brown K. An efficient four-phase heuristic for the generalised orienteering problem. Computers and Operations Research 18 (1991) 151-165
21. Ramesh R., Yoon Y., and Karwan M. An optimal algorithm for the orienteering tour problem. ORSA Journal on Computing 4 (1992) 155-165
22. Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D., 2006. Multilevel metaheuristics for the orienteering problem. In: Seventh EU/Meeting on Adaptive, Self-Adaptive and Multilevel Metaheuristics, Malaga.
23. Tang H., and Miller-Hooks E. A tabu search heuristic for the team orienteering problem. Computer and Operations Research 32 (2005) 1379-1407
24. Tsiligirides T. Heuristic methods applied to orienteering. Journal of the Operational Research Society 35 (1984) 797-809
25. Vansteenwegen P., and Van Oudheusden D. The mobile tourist guide: An OR opportunity. OR Insights 20 (2007) 21-27
26. Voudouris C., and Tsang E. Guided local search and its application to the travelling salesman problem. European Journal of Operational Research 113 (1999) 469-499
27. Zhong Y., and Cole M. A vehicle routing problem with backhauls and time windows: A guided local search solution. Transportation Research Part E 41 (2005) 131-144