An ant colony system for team orienteering problems with time windows

[1]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[2]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[3]  Michel Gendreau,et al.  The hot strip mill production scheduling problem: A tabu search approach , 1998, Eur. J. Oper. Res..

[4]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[5]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[6]  Stefan Irnich,et al.  A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics , 2008, INFORMS J. Comput..

[7]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[8]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[9]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

[10]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[11]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[14]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[15]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[16]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[17]  G. Laporte,et al.  A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem , 1998 .

[18]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[19]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[20]  Susumu Morito,et al.  Minimum directed 1-subtree relaxation for score orienteering problem , 1998 .

[21]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[22]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[23]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[24]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .

[25]  Cyrille Gueguen.  Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .

[26]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[27]  Randolph W. Hall,et al.  Transportation with common carrier and private fleets: system assignment and shipment frequency optimization , 1995 .

[28]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[29]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[30]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.