Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Computers and Operations Research

Volumn 40, Issue 7, 2013, Pages 1661-1670

  Weyland, Dennis ^a   Montemanni, Roberto ^a   Gambardella, Luca Maria ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Local search; Monte Carlo sampling; Random restart local search; Stochastic vehicle routing

Indexed keywords

COMPUTATIONAL STUDIES; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MONTE CARLO SAMPLING; OBJECTIVE FUNCTIONS; PROBABILISTIC TRAVELING SALESMAN PROBLEM; RANDOM RESTART; STOCHASTIC VEHICLE ROUTING;

LEARNING ALGORITHMS; STOCHASTIC SYSTEMS; TRAVELING SALESMAN PROBLEM;

MONTE CARLO METHODS;

EID: 84875921863     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.12.015     Document Type: Article

References (39)

1. Benchmark instances. 〈 http://myweb.uiowa.edu/bthoa/research.html 〉, 2008.
2. Complete numerical results. 〈 http://www.idsia.ch/~weyland 〉, 2010.
3. E.K. Baker An exact algorithm for the time-constrained traveling salesman problem Operations Research 31 5 1983 938 945
4. P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem European Journal of Operational Research 199 2009 98 110
5. P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo Estimation-based metaheuristics for the probabilistic traveling salesman problem Computers and Operations Research 37 11 2010 1939 1951
6. P. Balaprakash, M. Birattari, T. Stützle, Z.E. Yuan, and M. Dorigo Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem Swarm Intelligence 3 3 2009 223 242
7. D. Bertsimas, and L.H. Howell Further results on the probabilistic traveling salesman problem European Journal of Operational Research 65 1 1993 68 95
8. Bianchi L, Gambardella LM, Ant colony optimization and local search based on exact and estimated objective values for the probabilistic traveling salesman problem. Technical Report 06-07, IDSIA, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale; 2007.
9. L. Bianchi, L.M. Gambardella, and M. Dorigo Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic Lecture Notes in Computer Science 2002 176 187
10. L. Bianchi, L.M. Gambardella, and M. Dorigo An ant colony optimization approach to the probabilistic traveling salesman problem Lecture Notes in Computer Science 2003 883 892
11. Birattari M, Balaprakash P, Stützle T, Dorigo M. Estimation-based local search for stochastic combinatorial optimization. Technical Report TR/IRIDIA/2007-003, IRIDIA, Universite Libre de Bruxelles, Brussels, Belgium; 2007.
12. M. Birattari, P. Balaprakash, T. Stützle, and M. Dorigo Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem INFORMS Journal on Computing 20 4 2008 644 658
13. J. Branke, and M. Guntsch Solving the probabilistic TSP with ant colony optimization Journal of Mathematical Modelling and Algorithms 3 4 2004 403 425
14. A.M. Campbell Aggregation for the probabilistic traveling salesman problem Computers and Operations Research 33 9 2006 2703 2724
15. A.M. Campbell, and B.W. Thomas Probabilistic traveling salesman problem with deadlines Transportation Science 42 1 2008 1 21
16. A.M. Campbell, and B.W. Thomas Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines Computers and Operations Research 36 4 2009 1231 1248
17. K. Chepuri, and T. Homem-de Mello Solving the vehicle routing problem with stochastic demands using the cross-entropy method Annals of Operations Research 134 1 2005 153 181
18. C.H. Christiansen, and J. Lysgaard A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research Letters 35 6 2007 773 781
19. Desrochers M, Lenstra JK, Savelsbergh MWP, Soumis F. Vehicle routing with time windows: optimization and approximation. In: Golden BL Assad AA, editors, Vehicle routing: methods and studies. Elsevier Science Publishers; 1988. p. 65-84.
20. J. Desrosiers, M. Sauvé, and F. Soumis Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows Management Science 34 8 1988 1005 1022
21. Y. Dumas, J. Desrosiers, E. Gelinas, and M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Operations Research 43 2 1995 367 371
22. A.L. Erera, M. Savelsbergh, and E. Uyar Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints Networks 54 4 2009 270 283
23. Fuce F, Hui W, Ying ZL. Solving the vehicle routing problem with stochastic demands and customers. In: Sixth international conference on parallel and distributed computing, applications and technologies, 2005. PDCAT 2005. IEEE; 2005. p. 736-39.
24. M. Gendreau, G. Laporte, and R. Seguin An exact algorithm for the vehicle routing problem with stochastic demands and customers Transportation Science 29 2 1995 143 155
25. M. Gendreau, G. Laporte, and R. Seguin A tabu search heuristic for the vehicle routing problem with stochastic demands and customers Operations Research 56 1996 469 477
26. Jaillet P. Probabilistic traveling salesman problems. PhD thesis, M.I.T., Dept. of Civil Engineering; 1985.
27. A.W.J. Kolen, A.H.G. Rinnooy Kan, and H. Trienekens Vehicle routing with time windows Operations Research 35 2 1987 266 273
28. G. Laporte, F.V. Louveaux, and L. Van Hamme An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research 2002 415 423
29. H. Lei, G. Laporte, and B. Guo The capacitated vehicle routing problem with stochastic demands and time windows Computers and Operations Research 38 12 2011 1775 1783
30. X. Li, P. Tian, and S.C.H. Leung Vehicle routing problems with time windows and stochastic travel and service times models and algorithm International Journal of Production Economics 125 1 2010 137 145
31. Novoa C, Berger R, Linderoth J, Storer R. A set-partitioning-based model for the stochastic vehicle routing problem. Technical Report 06T-008, Lehigh University; 2006.
32. C. Novoa, and R. Storer An approximate dynamic programming approach for the vehicle routing problem with stochastic demands European Journal of Operational Research 196 2 2009 509 515
33. M. Pavone, N. Bisnik, E. Frazzoli, and V. Isler A stochastic and dynamic vehicle routing problem with time windows and customer impatience Mobile Networks and Applications 14 3 2009 350 364
34. M.W.P. Savelsbergh Local search in routing problems with time windows Annals of Operations Research 4 1 1985 285 305
35. Z. Shen, F. Ordónez, and M.M. Dessouky The stochastic vehicle routing problem for minimum unmet demand Optimization and Logistics Challenges in the Enterprise 2009 349 371
36. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
37. Weyland D, Bianchi L, Gambardella LM. New approximation-based local search algorithms for the probabilistic traveling salesman problem. In: Computer aided systems theory - EUROCAST 2009. 2009. p. 681-88.
38. Weyland D, Bianchi L, Gambardella LM. New heuristics for the probabilistic traveling salesman problem. In: Proceedings of the VIII metaheuristic international conference (MIC 2009); 2009.
39. Weyland D, Montemanni R, Gambardella LM. Hardness results for the probabilistic traveling salesman problem with deadlines. In: Proceedings of the 2nd international symposium on combinatorial optimization. 2012. p. 392-403.