Iterated local search for the team orienteering problem with time windows

Vansteenwegen, 2007, The mobile tourist guide: an OR opportunity, OR Insights, 20, 21, 10.1057/ori.2007.17 Tsiligirides, 1984, Heuristic methods applied to orienteering, Journal of the Operational Research Society, 35, 797, 10.1057/jors.1984.162 Laporte, 1990, The selective travelling salesman problem, Discrete Applied Mathematics, 26, 193, 10.1016/0166-218X(90)90100-Q Butt, 1994, A heuristic for the multiple tour maximum collection problem, Computers & Operations Research, 21, 101, 10.1016/0305-0548(94)90065-5 Arkin E, Mitchell J, Narasimhan G. Resource-constrained geometric network optimization. In: Proceedings of the 14th ACM symposium on computational geometry; 1998. p. 307–16. Pekny J, Miller D. 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; 1990. Feillet, 2005, Travelling salesman problems with profits, Transportation Science, 39, 188, 10.1287/trsc.1030.0079 Righini, 2009, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, Computers & Operations Research, 4, 1191, 10.1016/j.cor.2008.01.003 Chao, 1996, A fast and effective heuristic for the orienteering problem, European Journal of Operational Research, 88, 475, 10.1016/0377-2217(95)00035-6 Golden, 1987, The orienteering problem, Naval Research Logistics, 34, 307, 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D Tang, 2005, A tabu search heuristic for the team orienteering problem, Computers & Operations Research, 32, 1379, 10.1016/j.cor.2003.11.008 Archetti, 2007, Metaheuristics for the team orienteering problem, Journal of Heuristics, 13, 49, 10.1007/s10732-006-9004-0 Vansteenwegen, 2009, A guided local search metaheuristic for the team orienteering problem, European Journal of Operational Research, 196, 118, 10.1016/j.ejor.2008.02.037 Ke, 2008, Ants can solve the team orienteering problem, Computers & Industrial Engineering, 54, 648, 10.1016/j.cie.2007.10.001 Souffriau W, Vansteenwegen P, Vanden Berghe G, Van Oudheusden D. A path relinking approach for the team orienteering problem. Computers & Operations Research, special issue, Logistics 2009, under review. Boussier, 2007, An exact algorithm for the team orienteering problem, 4OR, 5, 211, 10.1007/s10288-006-0009-1 Kantor, 1992, The orienteering problem with time windows, The Journal of the Operational Research Society, 43, 629, 10.1057/jors.1992.88 Bar-Yehuda, 2005, On approximating a geometric prize-collecting travelling salesman problem with time windows, Journal of Algorithms, 55, 76, 10.1016/j.jalgor.2003.11.002 Mansini R, Pelizzari M, Wolfer R. 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. Righini G, Salani M. Dynamic programming for the orienteering problem with time windows. Technical Report 91, Dipartimento di Tecnologie dell’Informazione, Universita degli Studi Milano, Crema, Italy, 2006. Montemanni R, Gambardella L. Ant colony system for team orienteering problems with time windows. European Journal of Operational Research; 2009, under review. Righini, 2008, New dynamic programming algorithms for the resource constrained elementary shortest path, Networks, 51, 155, 10.1002/net.20212 Gendreau, 1998, A tabu search heuristic for the undirected selective travelling salesman problem, European Journal of Operational Research, 106, 539, 10.1016/S0377-2217(97)00289-0 Lourenço, 2003, Iterated local search, 321 Ibaraki, 2005, Effective local search algorithms for routing and scheduling with general time-window constraints, Transportation Science, 39, 206, 10.1287/trsc.1030.0085 Hashimoto, 2008, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Discrete Optimization, 5, 434, 10.1016/j.disopt.2007.05.004 Solomon, 1987, Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research, 35, 254, 10.1287/opre.35.2.254 Cordeau, 1997, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, 30, 105, 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G Lin, 1965, Computer solutions of the traveling salesman problem, Bell System Technical Journal, 44, 2245, 10.1002/j.1538-7305.1965.tb04146.x Hansen, 2001, Variable neighbourhood search: principles and applications, European Journal of Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4