On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance

References

• Albers S. Competitive Online Algorithms. OPTIMA: Math. Prog. Soc. Newsl. (1997) 54:1–8Google Scholar
• Bertsimas D., Ryzin G. V. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Opns. Res. (1991) 39:601–615Link, Google Scholar
• Bertsimas D. J., Simchi-levi D. A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty. Opns. Res. (1996) 44:286–304Link, Google Scholar
• Bertsimas D. J., Van Ryzin G. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Opns. Res. (1991) 39:601–615Link, Google Scholar
• Bertsimas D. J., Chervi P., Peterson M. Computational Approaches to Stochastic Vehicle Routing. Transp. Sci. (1995) 29:342–352Link, Google Scholar
• Cheung R., Powell W. B. An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management. Opns. Res. (1996) 44:951–963Link, Google Scholar
• Desrosiers J., Solomon M., Soumis and F., Monma C., Magnanti T., Ball M. Time Constrained Routing and Scheduling. Handbook in Operations Research and Management Science (1995) (North Holland, Amsterdam)35–139Volume on NetworksGoogle Scholar
• Dror M., Laporte G., Trudeau P. Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks. Transp. Sci. (1989) 23:166–176Link, Google Scholar
• Fisher M., Monma C., Magnanti T., Ball M. Vehicle Routing. Handbook in Operations Research and Management Science (1995) (North Holland, Amsterdam)1–33Volume on NetworksGoogle Scholar
• Frantzeskakis L., Powell W. A Successive Linear Approximation Procedure for Stochastic Dynamic Vehicle Allocation Problems. Transp. Sci. (1990) 24:40–57Link, Google Scholar
• Graham R. Bounds for Certain Multiprocessor Anomalies. Bell Syst. Tech. J. (1966) 45:1563–1581Crossref, Google Scholar
• Gusfield D., Irving R.The Stable Marriage Algorithm: Structure and Algorithms (1989) (MIT Press, Boston, MA) Google Scholar
• Jordan W., Turnquist M. A. A Stochastic Dynamic Network Model for Railroad Car Distribution. Transp. Sci. (1983) 17:123–145Link, Google Scholar
• Laporte G., Louveaux F., Gabzewicz J., Richard J., Wolsey L. Formulations and Bounds for the Stochastic Capacitated Vehicle Routing Problem with Uncertain Supplies. Economic Decision-Making: Games, Econometrics and Optimization (1990) (North Holland, Amsterdam)Google Scholar
• Pinedo M.Scheduling: Theory, Algorithm, and System (1995) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Powell W. B. A Stochastic Model of the Dynamic Vehicle Allocation Problem. Transp. Sci. (1986) 20:117–129Link, Google Scholar
• Powell W. B. An Operational Planning Model for the Dynamic Vehicle Allocation Problem with Uncertain Demands. Transp. Res. (1987) 21B:217–232Crossref, Google Scholar
• Powell W. B., Golden B., Assad A. A Comparative Review of Alternative Algorithms for the Dynamic Vehicle Allocation Problem. Vehicle Routing: Methods and Studies (1988) (North Holland, New York)249–292Google Scholar
• Powell W. B. A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. Transp. Sci. (1996) 30:195–219Link, Google Scholar
• Psaraftis H., Golden B., Assad A. Dynamic Vehicle Routing Problems. Vehicle Routing: Methods and Studies (1988) (North Holland, Amsterdam)223–248Google Scholar
• Schrijver P., Schrijver P. R.Supporting Fleet Management by Mobile Communications (1993) (The Netherlands)Google Scholar
• Sleator D. D., Tarjan R. E. Amortized Efficiency of List Update and Paging Rules. Com. ACM (1985) 28:202–208Crossref, Google Scholar
• Stewart W., Golden B. Stochastic Vehicle Routing: A Comprehensive Approach. Eur. J. Opns. Res. (1983) 14:371–385Crossref, Google Scholar
• Trudeau P., Dror M. Stochastic Inventory Routing: Route Design with Stockouts and Route Failures. Transp. Sci. (1992) 26:171–184Link, Google Scholar
• White W. Dynamic Transshipment Networks: An Algorithm and Its Application to the Distribution of Empty Containers. Networks (1972) 2:211–236Crossref, Google Scholar