Stochastic vehicle routing with random travel times

Transportation Science

Volumn 37, Issue 1, 2003, Pages 69-82

  Kenyon, Astrid S ^a   Morton, David P ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLEET OPERATIONS; FUNCTIONS; MONTE CARLO METHODS; RANDOM PROCESSES;

VEHICLE ROUTING;

VEHICLES;

EID: 0037294747     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.37.1.69.12820     Document Type: Article

References (45)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice Hall, Upper Saddle River, NJ.
2. Bastian, C., A. H. G. Rinnooy Kan. 1972. The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. 56 407-412.
3. Berman, O., D. Simchi-Levi. 1989. The traveling salesman location problem on stochastic networks. Transportation Sci. 23 54-57.
4. Bertsimas, D. J. 1992. A vehicle routing problem with stochastic demand. Oper. Res. 40 574-585.
5. _, L. H. Howell. 1993. Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. 65 68-95.
6. _, P. Jaillet, A. R. Odoni. 1990. A priori optimization. Oper. Res. 38 1019-1033.
7. Birge, J. R. 1982. The value of the stochastic solution in stochastic linear programs with fixed recourse. Math. Programming 24 314-325.
8. _, F. Louveaux. 1997. Introduction to Stochastic Programming. Springer-Verlag, New York.
9. Carraway, R. L., T. L. Morin, H. Moskowitz. 1989. Generalized dynamic programming for stochastic combinatorial optimization. Oper. Res. 37 819-829.
10. Clarke. G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
11. CPLEX. 1997. CPLEX Manual, Version 6.0: Using the CPLEX Callable Library Including the CPLEX Base System with CPLEX Barrier and Mixed Integer Solver Options. CPLEX Division, ILOG, Inc., Incline Village, NV.
12. Crowder, H., E. L. Johnson, M. Padberg. 1983. Solving large-scale zero-one linear programmIng problems. Oper. Res. 31 803-834.
13. Dantzig, G. B., D. R. Fulkerson, S. M. Johnson. 1954. Solution of a large-scale traveling-salesman problem. Oper. Res. 2 393-410.
14. Dror, M. 1993. Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. Eur. J. Oper. Res. 64 432-441.
15. _, P. Trudeau. 1986. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. 23 228-235.
16. _, G. Laporte P. Trudeau. 1989. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23 166-176.
17. Edirisinghe, N. C. P., W. T. Ziemba. 1992. Tight bounds for stochastic convex programs. Oper. Res. 40 660-677.
18. Edmundson, H. P. 1956. Bounds on the expectation of a convex function of a random variable. Technical Report, The Rand Corporation Paper 982, Santa Monica, CA.
19. Geoffrion, A. M. 1989. Computer-based modeling environment. Eur. J. Oper. Res. 41 33-43.
20. Henig, M. I. 1990. Risk criteria in a stochastic knapsack problem. Oper. Res. 38 820-825.
21. Hoffman, K. L., M. Padberg. 1991. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3 121-134.
22. Jaillet, P. 1985. Probabilistic traveling salesman problems. Technical Report No. 185, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
23. _. 1988. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36 929-936.
24. Jensen, J. L. 1906. Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Math. 30 175-193.
25. Kao, E. P. C. 1978. A preference order dynamic program for a stochastic traveling salesman problem. Oper. Res. 26 1033-1045.
26. Kataoka, S. 1963. A stochastic programming model. Econometrica 31 181-196.
27. Kleywegt, A. J., A. Shapiro, T. Homem-de-Mello. 1999. The sample average approximation method for stochastic discrete optimization. Stochastic Programming E-Print Series. 〈http://dochost.rz.hu-berlin.de/speps/〉.
28. Lambert, V., G. Laporte, F. Louveaux. 1993. Designing collection routes through bank branches. Comput. Oper. Res. 20 783-791.
29. Laporte, G., F. Louveaux. 1990. Formulations and bounds for the stochastic capacitated vehicle routing problem with uncertain supplies. J. Gabzewicz, J.-F. Richard, L. Wolsey, eds. Economic Decision Making: Games, Econometrics and Optimisation. North-Holland, Amsterdam, The Netherlands, 443-455.
30. _. 1993. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13 133-142.
31. _, H. Mercure. 1989. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39 71-78.
32. _. 1992. The vehicle routing problem with stochastic travel times. Transportation Sci. 26 161-170.
33. _. 1994. A priori optimization of the probabilistic traveling salesman problem. Oper. Res. 42 543-549.
34. _, Y. Nobert, M. Desrochers. 1985. Optimal routing under capacity and distance restrictions. Oper. Res. 33 1050-1073.
35. Leipälä, T. 1978. On the solutions of stochastic traveling salesman problems. Eur. J. Oper. Res. 2 291-297.
36. Loéve, M. 1963. Probability Theory, 3rd ed. D. Van Nostrand Company, Inc., Princeton, NJ.
37. Madansky, A. 1959. Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Statist. 30 743-746.
38. Mak, W. K., D. P. Morton, R. K. Wood. 1999. Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24 47-56.
39. Morton, D. P., R. K. Wood. 1998. On a stochastic knapsack problem and generalizations. D. Woodruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, Dordrecht, The Netherlands, 149-168.
40. Padberg, M., G. Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33 60-100.
41. Prékopa, A. 1995. Stochastic Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands.
42. Sniedovich, M. 1981. Analysis of a preference order traveling salesman problem. Oper. Res. 29 1234-1237.
43. Stewart, W. R., B. L. Golden. 1983. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14 371-385.
44. Van Slyke, R. M., R. J. -B. Wets. 1969. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17 638-663.
45. Wollmer, R. D. 1980. Two-stage linear programming under uncertainty with 0-1 integer first stage variables. Math. Programming 19 279-288.