The multiconstraint team orienteering problem with multiple time windows

Transportation Science

Volumn 47, Issue 1, 2013, Pages 53-63

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

^a ODISEE UNIVERSITY COLLEGE   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c GHENT UNIVERSITY   (Belgium)

Author keywords

Grasp; Iterated local search; Orienteering problem; Vehicle routing

Indexed keywords

HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); VEHICLE ROUTING;

GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HIGH-QUALITY SOLUTIONS; ITERATED LOCAL SEARCH; MATHEMATICAL FORMULATION; ORIENTEERING PROBLEM; TEAM ORIENTEERING PROBLEMS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

SENSITIVITY ANALYSIS;

EID: 84873595310     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1110.0377     Document Type: Article

References (27)

1. Archetti, C., D. Feillet, A. Hertz, M. G. Speranza. 2009. The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60 831-842.
2. Arkin, E., J. Mitchell, G. Narasimhan. 1998. Resource-constrained geometric network optimisation. Proc. 14th ACM Sympos. Computational Geometry, ACM, New York, 307-316.
3. Boussier, S., D. Feillet, M. Gendreau. 2007. An exact algorithm for the team orienteering problem. 4OR: Quart. J. Oper. Res. 5 211-230.
4. Butt, S., T. Cavalier. 1994. A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21 101-111.
5. Chao, I., B. Golden, E. Wasil. 1996. Theory and methodology - A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88 475-489. (Pubitemid 126368049)
6. Cordeau, J.-F., M. Gendreau, G. Laporte. 1997. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 105-119. (Pubitemid 127360996)
7. Feillet, D., P. Dejax, M. Gendreau. 2005. Travelling salesman problems with profits. Transportation Sci. 39 188-205.
8. Feo, T. A., M. G. C. Resende. 1989. A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8 67-71.
9. Garcia, A., P. Vansteenwegen, W. Souffriau, D. Arbelaitz, M. T. Linaza. 2009. Solving multiconstrained team orienteering problems to generate tourist routes. Working paper, Centre for Industrial Management, Katholieke Universiteit Leuven, Leuven, Belgium.
10. Gendreau, M., G. Laporte, F. Semet. 1998. A branch-and-cut algorithm for the undirected selective travelling salesman problem. Networks 32 263-273. (Pubitemid 128365136)
11. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
12. Gueguen, C. 1999. Methode de resolution exacte pour les problemes de tournes de vehicules. Ph.D. thesis, Ecole Centrale Paris, France.
13. Kataoka, S., S. Morito. 1988. An algorithm for the single constraint maximum collection problem. J. Oper. Res. Soc. Japan 31 515-530.
14. Laporte, G., S. Martello. 1990. The selective travelling salesman problem. Discrete Appl. Math. 26 193-207.
15. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell System Tech. J. 44 2245-2269.
16. Lourenço, H., O. Martin, T. Stützle. 2003. Iterated local search. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht, The Netherlands, 321-353.
17. Montemanni, R., L. Gambardella. 2009. Ant colony system for team orienteering problems with time windows. Foundations Comput. Decision Sci. 34 287-306.
18. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
19. Righini, G., M. Salani. 2009. Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 4 1191-1203.
20. Solomon, M. 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35 254-265. (Pubitemid 17652588)
21. Souffriau, W., P. Vansteenwegen, G. Vanden Berghe, D. Van Oudheusden. 2010. A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37 1853-1859.
22. Thomadsen, T., T. Stidsen. 2003. The quadratic selective travelling salesman problem. Technical Report 2003-17, Informatics and Mathematical Modelling, Technical University of Denmark, Kgs. Lyngby.
23. Tricoire, F., M. Romauch, K. Doerner, R. Hartl. 2010. Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37 351-367.
24. Tsiligirides, T. 1984. Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35 797-809.
25. Vansteenwegen, P., W. Souffriau, D. Van Oudheusden. 2011. The orienteering problem: A survey. Eur. J. Oper. Res. 209 1-10.
26. Vansteenwegen, P., D. Van Oudheusden. 2007. The mobile tourist guide: An OR opportunity. OR Insights 20 21-27.
27. Vansteenwegen, P., W. Souffriau, G. Vanden Berghe, D. Van Oudheusden. 2009. Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36 3281-3290.