Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights

References

• Balinsky M. L., Quandt R. E. On a large integer program for a delivery problem. Oper. Res. (1964) 12:300–304Link, Google Scholar
• Ballou R. H.Business Logistics Management (1985) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bambos N., Walrand J. Scheduling and stability aspects of a general class of parallel processing systems. Adv. Appl. Probab. (1993) 25:176–202Crossref, Google Scholar
• Bazaraa M. S., Jarvis J., Sherali H. D.Linear Programming and Network Flows (1990) (John Wiley & Sons, New York) Google Scholar
• Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–304Link, Google Scholar
• Bertsimas D. J., van Ryzin G. J. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39:601–615Link, Google Scholar
• Bertsimas D. J., van Ryzin G. J. Stochastic and dynamic vehicle routing in the Euclidean plane: The multiple-server, capacitated vehicle case. Oper. Res. (1993a) 41:60–76Link, Google Scholar
• Bertsimas D. J., van Ryzin G. J. Stochastic and dynamic vehicle routing with general interarrival and service time distributions. Adv. Appl. Probab. (1993b) 25:947–978Crossref, Google Scholar
• Billingsley P.Convergence of Probability Measures (1968) (John Wiley & Sons, New York) Google Scholar
• Ceria S., Sassano P. N. A. A Lagrangian-based heuristic for large-scale set covering problems. Math. Programming (1996) . ForthcomingGoogle Scholar
• Coffman E. G., Puhalskii A. A., Reiman M. I. Polling systems with zero switchover times: A heavy-traffic averaging principle. Ann. Appl. Probab. (1995a) 5:681–719Crossref, Google Scholar
• Coffman E. G., Puhalskii A. A., Reiman M. I. Polling systems in heavy traffic: A Bessel process limit. Math. Oper. Res. (1998) 23:257–304Link, Google Scholar
• Cullen F., Jarvis J., Ratliff D. Set partitioning based heuristics for interactive routing. Networks (1981) 11:125–143Crossref, Google Scholar
• Daley D. J., Kreinin A. Ya., Trengrove C. D., Bhat U. N., Basawa I. V. Inequalities concerning the waiting time in single server queues: A survey. Queueing and Related Models (1992) (Clarendon Press, Oxford, UK) Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transp. Sci. (1989) 23:166–176Link, Google Scholar
• Gans N. F., van Ryzin G. J. Optimal control of a multiclass, flexible queueing system. Oper. Res. (1997) 45:677–693Link, Google Scholar
• Giles F. R., Pulleyblank W. R. Total dual integrality and integer polyhedra. Linear Algebra Appl. (1979) 25:191–196Crossref, Google Scholar
• Higginson J. K., Bookbinder J. H. Markovian decision processes in shipment consolidation. Trans. Sci. (1994a) 29:242–255Link, Google Scholar
• Higginson J. K., Bookbinder J. H. Policy recommendations for a shipmentconsolidation problem. J. Bus. Logist. (1994b) 15:87–111Google Scholar
• Jaillet P., Odoni A., Golden B. L., Assad A. A. The probabilistic vehicle routing problem. Vehicle Routing: Methods and Studies (1988) (Elsevier North-Holland, Amsterdam) Google Scholar
• Kleinrock L.Queueing Systems (1976) 2(John Wiley & Sons, New York) Google Scholar
• Law A. M., Kelton W. D.Simulation Modeling and Analysis (1982) (McGraw-Hill, New York) Google Scholar
• Minkoff A. S. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. (1993) 41:77–90Link, Google Scholar
• Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Trans. Sci. (1995) 30:195–219Link, Google Scholar
• Powell W. B., Humblet P. The bulk service queue with a general control strategy: Theoretical analysis and a new computational procedure. Oper. Res. (1986) 34:267–275Link, Google Scholar
• Powell W. B., Jaillet P., Odoni A., Ball. Stochastic and dynamic networks and routing. Network Routing (1995) 8(Elsevier North-Holland, Amsterdam) . Chapter 3. Handbooks in OR & MSCrossref, Google Scholar
• Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (Elsevier North-Holland, Amsterdam) Google Scholar
• Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
• Reiman M. I., Rubio R., Wein L. M. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Trans. Sci. (1996) . ForthcomingGoogle Scholar
• Szczotka W. Exponential approximation of waiting time and queue size for queues in heavy traffic. Adv. Appl. Probab. (1990) 22:230–240Crossref, Google Scholar
• Whitt W. Planning queueing simulations. Management Sci. (1989) 35:1341–1366Link, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar