Anticipatory Route Selection

References

• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
• Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–303Link, Google Scholar
• Bertsimas D. J., van Ryzin G. 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. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993) 41:60–76Link, Google Scholar
• Chabini I. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Res. Record (1998) 1645:170–175Crossref, Google Scholar
• Ferris M. C., Ruszczyński A. Robust path choice in networks with failures. Networks (2000) 35:181–194Crossref, Google Scholar
• Fu L., Rilett L. R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Res. B (1998) 32:499–516Crossref, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12Crossref, Google Scholar
• Gendreau M., Guerten F., Potvin J.-Y., Taillard É. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• Hall R. W. The fastest path through a network with random time-dependent travel times. Transportation Sci. (1986) 20:182–188Link, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34:426–438Link, Google Scholar
• Jaillet P. A priori solution of the traveling salesman problem in which a random subset of customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
• Jaillet P., Odoni A. R., Golden B. L., Assad A. A. The probabilistic vehicle routing problem. Vehicle Routing: Methods and Studies (1988) ( North Holland, Amsterdam, The Netherlands)293–318Google Scholar
• Miller-Hooks E. D., Mahmassani H. S. Least possible time paths in stochastic, time-varying transportation networks. Comput. Oper. Res. (1998) 25:1107–1125Crossref, Google Scholar
• Miller-Hooks E. D., Mahmassani H. S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Sci. (2000) 34:198–215Link, Google Scholar
• Papastvrou J. D. A stochastic and dynamic routing policy using branching processes with state dependent migration. Eur. J. Oper. Res. (1996) 95:167–177Crossref, Google Scholar
• Pearl J.Heuristics: Intelligent Search Strategies for Computer Problem Solving (1984) (Addison-Wesley, Reading, MA) Google Scholar
• Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. (1996) 30:195–219Link, Google Scholar
• Powell W. B., Jaillet P., Odoni A. Stochastic and dynamic networks and routing. Handbook in OR and MS (1995) ( North Holland, Amsterdam, The Netherlands)141–295Google Scholar
• Powell W. B., Sheffi Y., Nickerson K. S., Butterbaugh K., Atherton S. Maximizing profits for North American Van Lines' truckload division: A new framework for pricing and operations. Interfaces (1988) 18:21–41Link, Google Scholar
• Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) ( North Holland, Amsterdam, The Netherlands)223–248Google Scholar
• Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
• Psaraftis H. N., Tsitsiklis J. N. Dynamic shortest paths in acyclic networks with Markovian arc costs. Oper. Res. (1993) 41:91–101Link, Google Scholar
• Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley and Sons, Inc., New York) Crossref, Google Scholar
• Regan A. C., Mahmassani H. S., Jaillet P. Improving efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies. Transportation Res. Record (1994) 1493:188–198Google Scholar
• Regan A. C., Mahmassani H. S., Jaillet P. Dynamic decision making for commercial fleet operations using real-time information. Transportation Res. Record (1995) 1537:91–97Crossref, Google Scholar
• Regan A. C., Mahmassani H. S., Jaillet P. Evaluation of fleet management systems: Simulation framework. Transportation Res. Record (1998) 1645:176–184Crossref, Google Scholar
• Swihart M. R., Papastavrou J. D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. (1999) 114:447–464Crossref, Google Scholar
• Yang J., Jaillet P., Mahmassani H. S. On-line algorithms for truck fleet assignment and scheduling. (1999) . Technical Report 993274, Department of Management Science and Information Systems, University of Texas at Austin, Austin, TXGoogle Scholar