Scenario-based planning for partially dynamic vehicle routing with stochastic customers

Operations Research

Volumn 52, Issue 6, 2004, Pages 977-987

  Bent, Russell W ^a   Van Hentenryck, Pascal ^a  

^a Brown Univerity   (United States)

Author keywords

Sampling; Stochastic model applications; Vehicle routing

Indexed keywords

ONBOARD COMPUTERS; STOCHASTIC MODEL APPLICATIONS; VEHICLE ROUTING; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

CONSTRAINT THEORY; CUSTOMER SATISFACTION; FUNCTIONS; OPTIMIZATION; PLANNING; PROBLEM SOLVING; QUALITY CONTROL; RANDOM PROCESSES; SAMPLING; VEHICLES;

COMBINATORIAL MATHEMATICS;

EID: 12344279362     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0124     Document Type: Article

References (35)

1. Ascheuer, N., S. Krumke, J. Rambau. 2000. Online dial-a-ride problems: Minimizing the completion time. STACS: 17th Annual Sympos. Theoret, Aspects Comput. Sci. 639-650.
2. Bent, R., P. Van Hentenryck. 2004. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. Forthcoming.
3. Bertsimas, D. 1992. A vehicle routing problem with stochastic demand. Oper. Res. 40 574-585.
4. Bertsimas, D., G. van Ryzin. 1991. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39 601-615.
5. Bertsimas, D., G. van Ryzin. 1993. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41 60-76.
6. Blanchi, L. 2000. Notes of dynamic vehicle routing - The state of the art. Technical report IDSIA-05-01, Manno-Lugano, Switzerland.
7. Burckert, H., K. Fischer, G. Vierke. 2000. Holonic transport scheduling with Teletruck. Appl. Artificial Intelligence 14 697-725.
8. Gendreau, M., J. Potvin. 1997. Dynamic vehicle routing and dispatching. Technical report CRT 97-38, Centre de Recherche sur les Transport, Universite de Montreal, Montreal, Quebec, Canada.
9. Gendreau, M., G. Laporte, R. Seguin. 1995. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. 29 143-155.
10. Gendreau, M., G. Laporte, R. Seguin. 1996a. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44 469-477.
11. Gendreau, M., G. Laporte, R. Seguin. 1996b. Stochastic vehicle routing. Eur. J. Oper. Res. 88 3-12.
12. Gendreau, M., G. Laporte, F. Semet. 2001. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27 1641-1653.
13. Gendreau, M., F. Guertin, J. Potvin, R. Seguin. 1998. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Technical report CRT-98-10, Centre de Recherche sur les Transport, Universite de Montreal, Montreal, Quebec, Canada.
14. Gendreau, M., F. Guertin, J. Y. Potvin, E. Taillard. 1999. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33(4) 381-390.
15. Hauptmeier, D., S. Krumke, J. Rambau. 2000. The online dial-a-ride problem under reasonable load. Lecture Notes Comput. Sci. 1767 125-136.
16. Ichoua, S., M. Gendreau, J. Y. Potvin. 2000. Diversion issues in real-time vehicle dispatching. Transporation Sci. 34 426-438.
17. Kilby, P., P. Presser, P. Shaw. 1999. Dynamic VRPs: A study of scenarios. Technical report APES-06-1998, University of St. Andrews, St. Andrews, Scotland.
18. Kindervater, G., M. Savelsbergh. 1997. Vehicle routing: Handling edge exchanges. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, New York, 337-360.
19. Krumke, S., J. Rambau, L. Torres. 2002. Real-time dispatching of guided and unguided automobile service units with soft time windows. Proc. 10th Annual Eur. Sympos. on Algorithms, Rome Italy, 637-648.
20. Laporte, G., F. Louveaux, H. Mercure. 1992. The vehicle routing problem with stochastic travel times. Transportation Sci. 26 161-170.
21. Larsen, A. 2000. The dynamic vehicle routing problem. Ph.D. thesis, Technical University of Denmark, Kongens, Lyngby, Denmark.
22. Larsen, A., O. Madsen, M. Solomon. 2002. Partially dynamic vehicle routing - Models and algorithms. J. Oper. Res. Soc. 53 638-646.
23. Lund, K., O. Madsen, J. Rygaard. 1996. Vehicle routing problems with varying degrees of dynamism. Technical report, IMM. Department of Mathematical Modeling, Technical University of Denmark, Kogens, Lyngby, Denmark.
24. Novaes, A., O. Graciolli. 1999. Designing multiple-vehicle delivery tours in a grid-cell format. Eur. J. Oper. Res. 119 613-634.
25. Powell, W. 1996. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. 30 195-219.
26. Powell, W., J. Shapiro, H. Simao. 2001. A representational paradigm for dynamic resource transformation problems. Ann. Oper. Res. 104 231-279.
27. Psaraftis, H. 1995. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61 143-164.
28. Savelsbergh, M., M. Sol. 1998. DRIVE: Dynamic routing of independent vehicles. Oper. Res. 46 474-490.
29. Secomandi, N. 2000. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27 1201-1225.
30. Secomandi, N. 2001. A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49 796-802.
31. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265.
32. Stefik, M. 1981. Planning with constraints (MOLGEN: Part 1). Artificial Intelligence 16 111-139.
33. Swihart, M., J. Papastavrou. 1999. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. 114 447-464.
34. Yang, W., K. Mathur, R. Ballou. 2000. Stochastic vehicle routing problem with restocking. Transportation Sci. 34 99-112.
35. Zhu, K., K. Ong. 2000. A reactive method for real time dynamic vehicle routing problem. 12th ICTAI, Vancouver, British Columbia, Canada.