Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching

References

• Adelman D. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management (2003) 5:348–371Link, Google Scholar
• Adelman D. A price-directed approach to stochastic inventory/routing. Oper. Res. (2004) 52:499–514Link, Google Scholar
• Bertsekas D., Tsitsiklis J.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsimas D. J. Probabilistic combinatorial optimization problems. (1988) . Ph.D. dissertation, Report No. 193, Operations Research Center, Massachusetts Institute of Technology, Boston, MAGoogle Scholar
• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
• Bertsimas D. J., Howell L. H. Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. (1993) 65:68–95Crossref, 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., 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 in the Euclidian plane with multiple capacitated vehicles. Oper. Res. (1993) 41:60–76Link, Google Scholar
• Bertsimas D. J., Jaillet P., Odoni A. R. A priori optimization. Oper. Res. (1990) 38:1019–1033Link, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23:166–176Link, Google Scholar
• Gendreau M., Laporte G., Séguin R. An exact algorithm for the vehicle routing problem with stochastic customers and demands. Transportation Sci. (1995) 29:143–155Link, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996a) 88:3–12Crossref, Google Scholar
• Gendreau M., Laporte G., Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. (1996b) 44:469–477Link, Google Scholar
• Gendreau M., Guertin F., Potvin J.-Y., Taillard É. D. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Boston, MA) Crossref, Google Scholar
• Godfrey G., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. (2002) 36:21–39Link, Google Scholar
• Jaillet P. Probabilistic traveling salesman problems. (1985) . Ph.D. dissertation, Massachusetts Institute of Technology, Boston, MAGoogle Scholar
• Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
• Jezequel A. Probabilistic vehicle routing problems. (1985) . Master’s thesis, Massachusetts Institute of Technology, Boston, MAGoogle Scholar
• Kleywegt A. J. Dynamic and stochastic models with freight distribution applications. (1996) . Ph.D. dissertation, Massachusetts Institute of Technology, Boston, MAGoogle Scholar
• Kleywegt A. J., Papastavrou J. D. The dynamic and stochastic knapsack problem. Oper. Res. (1998) 46:17–35Link, Google Scholar
• Kleywegt A. J., Papastavrou J. D. The dynamic and stochastic knapsack problem with random sized items. Oper. Res. (2001) 49:26–41Link, Google Scholar
• Kleywegt A. J., Nori V. S., Savelsbergh M. W. P. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. (2004) 38:42–70Link, Google Scholar
• Laporte G., Louveaux F. V., Mercure H. A priori optimization of the probabilistic traveling salesman problem. Oper. Res. (1994) 42:543–549Link, Google Scholar
• Larsen A. The dynamic vehicle routing problem. (2000) . Ph.D. dissertation, Technical University of Denmark, Lyngby, DenmarkGoogle Scholar
• Larsen A., Madsen O., Solomon M. M. Partially dynamic vehicle routing—Models and algorithms. J. Oper. Res. Soc. (2002) 53:637–646Crossref, Google Scholar
• Larsen A., Madsen O., Solomon M. M. The a priori dynamic traveling salesman problem with time windows. Transportation Sci. (2004) 38:459–472Link, Google Scholar
• Mitrović-Minić S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:635–655Crossref, Google Scholar
• Mitrović-Minić S., Krishnamurti R., Laporte G. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:669–685Crossref, Google Scholar
• Papastavrou J. D., Rajagopalan S., Kleywegt A. J. The dynamic and stochastic knapsack problem with deadlines. Management Sci. (1996) 42:1706–1718Link, Google Scholar
• Powell W. B., Golden B. L., Assad A. A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing: Methods and Studies (1988) (North Holland, Amsterdam, The Netherlands)249–291Google 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., Topaloglu H. Stochastic programming in transportation and logistics. Stochastic Programming, Handbook in Operations and Management Sciences (2003) 10(Elsevier, Amsterdam, The Netherlands) 555–635Crossref, Google Scholar
• Powell W. B., Jaillet P., Odoni A., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam, The Netherlands)141–295Google Scholar
• Rochat Y., Taillard É. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Rubio Maqueo R. Dynamic-stochastic vehicle routing and inventory problem. (1995) . Ph.D. dissertation, Massachusetts Institute of Technology, Boston, MAGoogle Scholar
• Secomandi N. Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. (1998) . Ph.D. dissertation, College of Business Administration, University of Houston, Houston, TXGoogle Scholar
• Secomandi N. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. (2000) 27:1201–1225Crossref, Google Scholar
• Séguin R. Problèmes stochastiques de tournées de véhicules. (1994) . Ph.D. dissertation, Département d’Informatique et de Recherche Opérationnelle, Université de Montréal, Montréal, QuébecGoogle Scholar
• Spivey M., Powell W. B. The dynamic assignment problem. Transportation Sci. (2004) 38:399–419Link, Google Scholar
• Sutton R. S., Barto A. G.Reinforcement Learning (1998) (MIT Press, Cambridge, MA) 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
• Taillard É. D., Badeau P., Gendreau M., Guertin F., Potvin J.-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. (1997) 31:170–186Link, Google Scholar
• Thomas B. W., White C. C. Anticipatory route selection. Transportation Sci. (2004) 38:473–487Link, Google Scholar
• Toth P., Vigo D. SIAM Monographs on Discrete Mathematics and Applications. The Vehicle Routing Problem (2002) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Waters C. D. J. Vehicle routing problems with uncertainty and omitted customers. J. Oper. Res. Soc. (1989) 40:1099–1108Crossref, Google Scholar
• Yang W. H., Mathur K., Ballou R. H. Stochastic vehicle routing problem with restocking. Transportation Sci. (2000) 34(1Link, Google Scholar