A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands

Transportation Science

Volumn 41, Issue 2, 2007, Pages 222-237

  Ak, Aykagan ^a   Erera, Alan L ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Stochastic vehicle routing

Indexed keywords

HEURISTIC ALGORITHMS; ROUTING ALGORITHMS; SALES; STOCHASTIC SYSTEMS; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLES; COMPUTATIONAL STUDIES; CUSTOMER DEMANDS; DEMAND DISTRIBUTION; STOCHASTIC DEMAND; STOCHASTIC VEHICLE ROUTING; TABU SEARCH HEURISTIC; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 70449927206     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1060.0180     Document Type: Article

References (15)

1. Bertsimas, D. J. 1992. A vehicle routing problem with stochastic demand. Oper. Res. 40 574-585.
2. Bertsimas, D. J., D. Simchi-Levi. 1996. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44 286-303.
3. Dror, M., P. Trudeau. 1986. Stochastic vehicle routing with a modified savings algorithm. Eur. J. Oper. Res. 23 228-235.
4. Dror, M., G. Laporte, P. Trudeau. 1989. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23 166-176.
5. Erera, A. L. 2000. Design of large-scale logistics systems for uncertain environments. Ph. D. thesis, Department of Industrial Engineering and Operations Research, University of California-Berkeley, Berkeley, CA.
6. Erera, A. L., C. F. Daganzo. 2003. A dynamic scheme for stochastic vehicle routing. Transportation Sci. Forthcoming.
7. Gendreau, M., G. Laporte, R. Séguin. 1995. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. 29 143-155.
8. Gendreau, M., G. Laporte, R. Séguin. 1996a. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44 469-477.
9. Gendreau, M., G. Laporte, R. SeAguin. 1996b. Stochastic vehicle routing. Eur. J. Oper. Res. 88 3-12.
10. Laporte, G., F. V. Louveaux. 1993. The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13 133-142.
11. Laporte, G., Y. Nobert. 1980. A cutting planes algorithm for the m-salesman problem. J. Oper. Res. Soc. 31 1017-1023.
12. Laporte, G., F. V. Louveaux, H. Mercure. 1989. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39 71-78.
13. Laporte, G., F. V. Louveaux, L. Van Hamme. 2002. An integer l-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50 415-423.
14. Stewart, W., B. Golden. 1983. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14 371-385.
15. Verweij, B., S. Ahmed, A. Kleywegt, G. Nemhauser, A. Shapiro. 2003. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24 289-333.