User menu

The Static and Stochastic VRP with Time Windows and both random Customers and Reveal Times

Bibliographic reference Saint-Guillain, Michael ; Solnon, Christine ; Deville, Yves. The Static and Stochastic VRP with Time Windows and both random Customers and Reveal Times.EvoApplications 2017In: Applications of Evolutionary Computation: 20th European Conference, EvoApplications 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings, Part II, 2017, p. 110-127
Permanent URL http://hdl.handle.net/2078.1/186427
  1. Bent, R.W., Van Hentenryck, P.: Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI, pp. 1816–1821 (2007)
  2. Ichoua Soumia, Gendreau Michel, Potvin Jean-Yves, Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching, 10.1287/trsc.1050.0114
  3. Saint-Guillain Michael, Deville Yves, Solnon Christine, A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW, Integration of AI and OR Techniques in Constraint Programming (2015) ISBN:9783319180076 p.357-374, 10.1007/978-3-319-18008-3_25
  4. Branke Jürgen, Middendorf Martin, Noeth Guntram, Dessouky Maged, Waiting Strategies for Dynamic Vehicle Routing, 10.1287/trsc.1040.0095
  5. Bertsimas Dimitris J., A Vehicle Routing Problem with Stochastic Demand, 10.1287/opre.40.3.574
  6. Jaillet, P.: Probabilistic traveling salesman problems. Ph.D. thesis, Massachusetts Institute of Technology (1985)
  7. Laporte Gilbert, Louveaux François V., Mercure Hélène, A Priori Optimization of the Probabilistic Traveling Salesman Problem, 10.1287/opre.42.3.543
  8. Laporte Gilbert, Louveaux François V., The integer L-shaped method for stochastic integer programs with complete recourse, 10.1016/0167-6377(93)90002-x
  9. Jezequel, A.: Probabilistic vehicle routing problems. Ph.D. thesis, Massachusetts Institute of Technology (1985)
  10. Bertsimas Dimitris, Chervi Philippe, Peterson Michael, Computational Approaches to Stochastic Vehicle Routing Problems, 10.1287/trsc.29.4.342
  11. Bianchi Leonora, Campbell Ann Melissa, Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem, 10.1016/j.ejor.2005.05.027
  12. Bowler Neill E., Fink Thomas M. A., Ball Robin C., Characterization of the probabilistic traveling salesman problem, 10.1103/physreve.68.036703
  13. Bianchi Leonora, Gambardella Luca Maria, Dorigo Marco, An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem, Parallel Problem Solving from Nature — PPSN VII (2002) ISBN:9783540441397 p.883-892, 10.1007/3-540-45712-7_85
  14. Waters C. D. J., Vehicle-scheduling Problems with Uncertainty and Omitted Customers, 10.1057/jors.1989.191
  15. Gendreau Michel, Laporte Gilbert, Séguin René, An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers, 10.1287/trsc.29.2.143
  16. Séguin, R.: Problèmes stochastiques de tournées de vehicules, Université de Montréal (1994)
  17. Gendreau Michel, Laporte Gilbert, Séguin René, A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers, 10.1287/opre.44.3.469
  18. Gounaris Chrysanthos E., Repoussis Panagiotis P., Tarantilis Christos D., Wiesemann Wolfram, Floudas Christodoulos A., An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem, 10.1287/trsc.2014.0559
  19. Campbell Ann M., Thomas Barrett W., Probabilistic Traveling Salesman Problem with Deadlines, 10.1287/trsc.1070.0203
  20. Henchiri Abir, Bellalouna Monia, Khaznaji Walid, A probabilistic traveling salesman problem: a survey, 10.15439/2014f381
  21. Sungur Ilgaz, Ren Yingtao, Ordóñez Fernando, Dessouky Maged, Zhong Hongsheng, A Model and Algorithm for the Courier Delivery Problem with Uncertainty, 10.1287/trsc.1090.0303
  22. Chao I-Ming, Golden Bruce L., Wasil Edward A., The team orienteering problem, 10.1016/0377-2217(94)00289-4
  23. Kirkpatrick S., Gelatt C. D., Vecchi M. P., Optimization by Simulated Annealing, 10.1126/science.220.4598.671
  24. Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Local search in combinatorial optimization, pp. 337–360 (1997)
  25. Taillard Éric, Badeau Philippe, Gendreau Michel, Guertin François, Potvin Jean-Yves, A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows, 10.1287/trsc.31.2.170
  26. Ahmed, S., Shapiro, A.: The sample average approximation method for stochastic programs with integer recourse (2002). Submitted for publication