A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

Computers and Operations Research

Volumn 28, Issue 8, 2001, Pages 803-826

  Chan, Yupo ^a   Carter, William B ^b   Burnes, Michael D ^c  

^a University of Arkansas   (United States)

^b Limited Brands   (United States)

^c USAF   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; DECISION MAKING; PROBLEM SOLVING; RANDOM PROCESSES; REAL TIME SYSTEMS;

LOCATION-ROUTING PROBLEMS;

OPERATIONS RESEARCH;

ROUTING; STOCHASTICITY;

EID: 0035400636     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00009-5     Document Type: Article

References (32)

1. Bertsimas D.J., Simchi-Levi D. A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research. 44:1996;286-304.
2. Kleinrock L. Queuing systems, Vols. I and II. 1975;Wiley, New York, NY.
3. Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: properties and solution frameworks. Transportation Science. 23:1989;166-176.
4. Bertsimas D.J., Jaillet P., Odoni A.R. A priori optimization. Operations Research. 38:1990;1019-1033.
5. Joshi R.R. A new heuristic algorithm for probabilistic optimization. Computers & Operations Research. 24:1997;687-697.
6. Assad A.A. Modeling and implementing issues in vehicle routing. Golden B.L., Assad A.A. Vehicle routing: methods and studies. 1988;North-Holland, Amsterdam.
7. Mandl C. Applied network optimization. 1979;Academic Press, New York, NY.
8. Neddef D. A remark on 'Integer linear programming formulation for a vehicle routing problem' by N.R. Achutan and L. Caccetta, or how to use the Clarke and Wright Savings to write such integer linear programming formulations. European Journal of Operational Research. 75:1994;238-241.
9. Dror M., Trudeau P. Savings by split delivery routing. Transportation Science. 23:1989;141-145.
10. Bartholdi J. III, Platzman LK. Heuristics based on spacefilling curves for combinatorial problems in Euclidean space. Management Science 1988;34:291-305.
11. Bowerman R.L., Calamai P.H., Hall G.B. The spacefilling curve with optimal partitioning heuristic for the vehicle routing problems. European Journal of Operational Research. 76:1994;128-142.
12. Carter WB. Allocation and routing of CRAF MD80 aircraft. Masters thesis, AFIT/GST/ENS/90M-4, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio, 1990.
13. Laporte et al. An exact algorithm for solving a capacitated location-routing problems. Annals of Operations Research 1986;6:293-310.
14. Araque JR. Contributions to the polyhedral approach to the vehicle routing problem. Ph.D. dissertation, State University of New York at Stony Brook, 1989.
15. Kulkarni R.V., Bhave P.R. Integer programming formulations of vehicle routing problems. European Journal of Operational Research. 34:1985;403-404.
16. Achutan N.R., Caccetta L. Integer linear programming formulation for a vehicle routing problem. European Journal of Operational Research. 52:1991;86-89.
17. Baker S. Location and routing of the defense courier service aerial network. Master's Thesis, Department of Operational Sciences, Air Force Institute of Technology. Wright-Patterson AFB, Ohio, 1991.
18. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters. 10:1991;27-36.
19. Chan Y., Merrill D. Probabilistic multiple-travelling-salesmen facility-location problem: space filling curve and asymptotic Euclidean analysis. Military Operations Research. 3(2):1997;37-53.
20. Higel J., Sen S. Stochastic decomposition: a statistical method for large scale stochastic linear programming. 1996;Kluwer Academic Press, Norwell, MA.
21. Burnes MD. Application of vehicle routing heuristics to an aeromedical airlift problem. Master's thesis, AFIT/GST/ENS/90M-3, Department of Operational Sciences, Air Force Institute of Technology. Wright-Patterson AFB, Ohio, 1990.
22. Hakimi S. Optimal location of switching centers and the absolute center and the medians of a graph. Operations Research. 12:1964;450-459.
23. Berman O., Simchi-Levi D. A Heuristic algorithm for the travelling salesman location problem on networks. Operations Research. 36:1988;478-484.
24. Bertsimas D. Traveling salesman facility location problems. Transportation Science. 23:1989;184-191.
25. Berman O, Simchi-Levi D. Finding the optimal a priori tour and location of a travelling salesman with non-homogeneous customers. Transportation Science 1988a;22:148-54.
26. Laporte G., Louveau F.V., Mercure H. A priori optimization of the probabilistic traveling salesman problem. Operations Research. 42:1994;543-549.
27. Merrill D. Facility location and routing to minimize the enroute distance of flight inspection missions. Master's thesis, Department of Operational Sciences, Air Force Institute of Technology. Wright-Patterson AFB, Ohio, 1989.
28. Day R.H. Recursive programming and production response. 1963;North-Holland, Amsterdam.
29. Wets R.J.-.B. Solving stochastic program with simple recourse. Stochastics. 10:1983;219-242.
30. Birge J. Current trends in stochastic programming computation and applications. Working paper, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan, 1995.
31. Birge J., Louveaux F. Introduction to stochastic programming. 1997;Springer, New York, NY.
32. Carøe C.C., Schultz R. Dual decomposition in stochastic integer programming. Operations Research Letters. 24:1999;37-45.