The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization

Applied Soft Computing Journal

Volumn 13, Issue 9, 2013, Pages 3806-3815

  López Ibáñez, Manuel ^a   Blum, Christian ^b,c   Ohlmann, Jeffrey W ^d   Thomas, Barrett W ^d  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b BASQUE FOUNDATION FOR SCIENCE   (Spain)

^c UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^d UNIVERSITY OF IOWA   (United States)

Author keywords

Ant colony optimization; Compressed simulated annealing; Hybridization; Travelling salesman problem with time windows

Indexed keywords

ANT COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; SIMULATED ANNEALING; TRAVEL TIME; VEHICLE ROUTING;

HYBRIDIZATION; MAKESPAN MINIMIZATION; MATHEMATICAL STRUCTURE; RESEARCH COMMUNITIES; STATE-OF-THE-ART ALGORITHMS; STATE-OF-THE-ART APPROACH; TIME WINDOWS; TRAVELLING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 84884417651     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2013.05.009     Document Type: Article

References (27)

1. M.W.P. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research 4 (1) (1985) 285-305, doi: 10.1007/BF02022044.
2. J.W. Ohlmann, B.W. Thomas, A compressed-annealing heuristic for the traveling salesman problem with time windows, INFORMS Journal on Computing 19 (1) (2007) 80-90, 1526-5528, doi: 10.1287/ijoc.1050.0145.
3. M. López-Ibáñez, C. Blum, Beam-ACO for the travelling salesman problem with time windows, Computers and Operations Research 37 (9) (2010) 1570-1583, doi: 10.1016/j.cor.2009.11.015.
4. N. Christofides, A. Mingozzi, P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks 11 (1981) 145-164, doi: 10.1002/net.3230110207. (Pubitemid 13506977)
5. E.K. Baker, An exact algorithm for the time-constrained traveling salesman problem, Operations Research 31 (5) (1983) 938-945, doi: 10.1287/opre.31.5.938.
6. A. Langevin, M. Desrochers, J. Desrosiers, S. Gélinas, F. Soumis, A two-commodity flow formulation for the traveling salesman and makespan problems with time windows, Networks 23 (7) (1993) 631-640.
7. Y. Dumas, J. Desrosiers, E. Gelinas, M.M. Solomon, An optimal algorithm for the traveling salesman problem with time windows, Operations Research 43 (2) (1995) 367-371.
8. N. Ascheuer, M. Fischetti, M. Grötschel, Solving asymmetric travelling salesman problem with time windows by branch-and-cut, Mathematical Programming 90 (2001) 475-506. (Pubitemid 33758918)
9. E. Balas, N. Simonetti, Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study, INFORMS Journal on Computing 13 (1) (2001) 56-75, doi: 10.1287/ijoc.13.1.56.9748. (Pubitemid 33645994)
10. G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau, An exact constraint logic programming algorithm for the traveling salesman problem with time windows, Transportation Science 32 (1998) 12-29.
11. F. Focacci, A. Lodi, M. Milano, A hybrid exact algorithm for the TSPTW, INFORMS Journal on Computing 14 (2002) 403-417.
12. W.B. Carlton, J.W. Barnes, Solving the traveling-salesman problem with time windows using tabu search, IIE Transactions 28 (1996) 617-629. (Pubitemid 126760955)
13. M. Gendreau, A. Hertz, G. Laporte, M. Stan, A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research 46 (1998) 330-335.
14. R. Wolfler Calvo, A new heuristic for the traveling salesman problem with time windows, Transportation Science 34 (1) (2000) 113-124, doi: 10.1287/trsc.34.1.113.12284.
15. R. Ferreira da Silva, S. Urrutia, A general VNS heuristic for the traveling salesman problem with time windows, Discrete Optimization 7 (4) (2010) 203-211.
16. C.-B. Cheng, C.-P. Mao, A modified ant colony system for solving the travelling salesman problem with time windows, Mathematical and Computer Modelling 46 (2007) 1225-1235, doi: 10.1016/j.mcm.2006.11.035. (Pubitemid 47364823)
17. L.M. Gambardella, É.D. Taillard, G. Agazzi, MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw Hill, London, UK, 1999, pp. 63-76.
18. D. Favaretto, E. Moretti, P. Pellegrini, Ant colony system approach for variants of the traveling salesman problem with time windows, Journal of Information and Optimization Sciences 27 (1) (2006) 35-54. (Pubitemid 43431054)
19. C. Blum, M. Mastrolilli, Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge., in: T. Bartz-Beielstein, M.J. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, M. Sampels (Eds.), Hybrid Metaheuristics, vol. 4771 of Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 2007, pp. 123-139.
20. H. Juillé, J.B. Pollack, A sampling-based heuristic for tree search applied to grammar induction, in: Proceedings of AAAI 1998 - Fifteenth National Conference on Artificial Intelligence, MIT Press, Cambridge, MA, 776-783, 1998.
21. W. Ruml, Incomplete tree search using adaptive probing, in: Proceedings of IJCAI 2001 - Seventeenth International Joint Conference on Artificial Intelligence, IEEE Press, 2001, pp. 235-241.
22. J.-Y. Potvin, S. Bengio, The vehicle routing problem with time windows part II: genetic search, INFORMS Journal on Computing 8 (1996) 165-172. (Pubitemid 126681528)
23. M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time windows, Operations Research 35 (1987) 254-265.
24. N. Ascheuer, Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems, Ph.D. thesis, Technische Universität Berlin, Berlin, Germany, 1995.
25. P. Balaprakash, M. Birattari, T. Stützle, Improvement strategies for the F-race algorithm: sampling design and iterative refinement, in: T. Bartz-Beielstein, M.J. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, M. Sampels (Eds.), Hybrid Metaheuristics, vol. 4771 of Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 2007, pp. 108-122.
26. M. López-Ibáñez, J. Dubois-Lacoste, T. Stützle, M. Birattari, The irace package, Iterated Race for Automatic Algorithm Configuration, Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium, 2011, http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2011- 004.pdf.
27. M. López-Ibáñez, T. Stützle, The automatic design of multi-objective ant colony optimization algorithms, IEEE Transactions on Evolutionary Computation 16 (6) (2012) 861-875, doi: 10.1109/TEVC.2011. 2182651.