Stochastic Vehicle Routing Problem with Restocking

References

  • Bartholdi J. J., Platzman L. K., Collins R. L., Warden W. H. A Minimal Technology Routing system for Meals on Wheels. Interfaces (1983) 13:1–8LinkGoogle Scholar
  • Bastian C., Rinnooy kan A. H. G. The Stochastic Vehicle Routing Problems Revisited. Eur. J. Oper. Res. (1992) 56:407–412CrossrefGoogle Scholar
  • Berman O., Simchi-Levi D. Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Non-Homogeneous Customers. Transp. Sci. (1988) 22:148–154LinkGoogle Scholar
  • Bertsimas D. J. Probabilistic Combinatorial Optimization Problems. (1988) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Bertsimas D. J. A Vehicle Routing Problem with Stochastic Demand. Opns. Res. (1992) 40:574–585LinkGoogle Scholar
  • Bertsimas D. J., Chervi P., Peterson M. Computational Approaches to Stochastic Vehicle Routing. Transp. Sci. (1995) 29:342–352LinkGoogle Scholar
  • Bertsimas D. J., Howell L. H. Further Results on the Probabilistic Traveling Salesman Problem. Eur. J. Oper. Res. (1993) 65:68–95CrossrefGoogle Scholar
  • Bertsimas D. J., Jaillet P., Odoni A. A Priori Optimization. Opns. Res. (1990) 38:1019–1033LinkGoogle Scholar
  • Bodin L. D., Golden B. L., Assad A. A., Ball M. O. Routing and Scheduling of Vehicles and Crews. The State of the Art. Comp. Oper. Res. (1983) 16:69–211Google Scholar
  • Christofides N., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Vehicle Routing. The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, U.K) 431–448Google Scholar
  • Clarke C., Wright J. W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Opns. Res. (1964) 12:568–581LinkGoogle Scholar
  • Dror M. Modeling Vehicle Routing with Uncertain Demands as a Stochastic Program: Properties of the Corresponding Solution. Eur. J. Oper. Res. (1993) 64:432–441CrossrefGoogle Scholar
  • Dror M., Ball M. O., Golden B. L. Computational Comparison of Algorithms for Inventory Routing. Ann. Opns. Res. (1985) 4:3–23CrossrefGoogle Scholar
  • Dror M., Laporte G., Louveaux F. Vehicle Routing with Stochastic Demands and Restricted Failures. Z. Oper. Res. (1993) 37:273–283Google Scholar
  • Dror M., Laporte G., Trudeau P. Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks. Transp. Sci. (1989) 23:166–176LinkGoogle Scholar
  • Dror M., Trudeau P. Stochastic Vehicle Routing with Modified Savings Algorithm. Eur. J. Oper. Res. (1986) 23:228–235CrossrefGoogle Scholar
  • Fisher M. L., Jaikumar R. A Generalized Assignment Heuristic for Vehicle Routing. Networks (1981) 11:109–124CrossrefGoogle Scholar
  • Foster B. A., Ryan D. An Integer Programming Approach to the Vehicle Scheduling Problem. Oper. Res. Q. (1976) 27:367–384CrossrefGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers. Transp. Sci. (1995) 29:143–155LinkGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers. Opns. Res. (1996a) 44:469–477LinkGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. Stochastic Vehicle Routing. Eur. J. Oper. Res. (1996b) 88:3–12CrossrefGoogle Scholar
  • Golden B. L., Assad A. A.Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam)Google Scholar
  • Golden B. L., Assad A. A., Levy L., Gheysens F. The Fleet Size and Mix Vehicle Routing Problem. Comp. Oper. Res. (1984) 11:49–66CrossrefGoogle Scholar
  • Jaillet P. Probabilistic Traveling Salesman Problems. (1985) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Jaillet P. A Priori Solution of Traveling Salesman Problem in which a Random Subset of the Customers are Visited. Opns. Res. (1988) 36:929–936LinkGoogle Scholar
  • Jaillet P., Bradley H. E. Probabilistic Routing Problems in the Plane. Operational Research ’90 (1991) (Pergamon Press, New York) Google Scholar
  • Jaillet P. Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces. Math. Opns. Res. (1993) 18:51–70LinkGoogle Scholar
  • Jaillet P., Odoni A., Golden B. L., Assad A. A. The Probabilistic Vehicle Routing Problem. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam)Google Scholar
  • Lambert V., Laporte G., Louveaux F. V. Designing Collection Routes through Bank Branches. Comp. Oper. Res. (1993) 20:783–791CrossrefGoogle Scholar
  • Laporte G. The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. Eur. J. Oper. Res. (1992) 59:345–358CrossrefGoogle Scholar
  • Laporte G., Louveaux F., Gabzewicz J. J., Richard J. F., Wolsey L. A. Formulations and Bounds for Stochastic Vehicle Routing Problem with Uncertain Supplies. Economic Decision-Making: Games, Econometrics, and Optimization (1990) (North-Holland, Amsterdam)Google Scholar
  • Laporte G., Louveaux F. V. The Integer L-Shaped Method for Stochastic Integer Programs with Complete Recourse. Opns. Res. Lett. (1993) 13:133–142CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V., Mercure H. Models and Exact Solutions for a Class of Stochastic Location-Routing Problems. Eur. J. Oper. Res. (1989) 39:71–78CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V., Mercure H. A Priori Optimization of the Probabilistic Traveling Salesman Problem. Opns. Res. (1994) 42:543–549LinkGoogle Scholar
  • Larson R. C. Transportation of Sludge to the 106-Mile Site: An Inventory Routing Algorithm for Fleet sizing and Logistic System Design. Transportation Science (1988) 22:186–198LinkGoogle Scholar
  • Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, U.K) Google Scholar
  • Or I. Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking. (1976) . Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
  • Ryan D. M., Hjorring C., Glover F. Extensions of the Petal Method for Vehicle Routing. J. Oper. Res. Soc. (1993) 44:289–296CrossrefGoogle Scholar
  • Stewart W. R., Golden B. L. Stochastic Vehicle Routing: A Comprehensive Approach. Eur. J. Oper. Res. (1983) 14:371–385CrossrefGoogle Scholar
  • Savelsbergh M. W. P., Goetschalckx M. A Comparison of the Efficiency of Fixed Versus Variable Vehicle Routes. J. Bus. Logist. (1995) 16:163–187Google Scholar
  • Teodorovic D., Pavkovic G. A Simulated Annealing Technique Approach to the Vehicle Routing Problem in the Case of Stochastic Demand. Transp. Plan. Technol. (1992) 16:261–273CrossrefGoogle Scholar
  • Tillman F. A. The Multiple Terminal Delivery Problem with Probabilistic Demands. Transp. Sci. (1969) 3:192–204LinkGoogle Scholar
  • Yang W. H. Stochastic Vehicle Routing with Optimal Restocking. (1996) . Ph.D. dissertation, Case Western Reserve University, Cleveland, OHGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.