Dynamic vehicle dispatching: optimal heavy traffic performance and practical insights

Operations Research

Volumn 47, Issue 5, 1999, Pages 675-692

  Gans, Noah ^a   Van Ryzin, Garrett ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DISTRIBUTION OF GOODS; HEURISTIC METHODS; MATHEMATICAL MODELS; QUEUEING THEORY; SCHEDULING; TRANSPORTATION ROUTES;

DYNAMIC ROUTING; DYNAMIC VEHICLE DISPATCHING; LOAD CONSOLIDATION PROBLEMS;

OPTIMIZATION;

EID: 0033327144     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.5.675     Document Type: Article

References (33)

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