An approximate dynamic programming algorithm for large-scale fleet management: A case application

Transportation Science

Volumn 43, Issue 2, 2009, Pages 178-197

  Simão, Hugo P ^a   Day, Jeff ^b   George, Abraham P ^a   Gifford, Ted ^b   Nienow, John ^a   Powell, Warren B ^a  

^a Princeton University   (United States)

^b Schneider National Inc   (United States)

Author keywords

Approximate dynamic programming; Driver management; Fleet management; Truckload trucking

Indexed keywords

FLEET OPERATIONS; LEARNING SYSTEMS; TRUCK TRANSPORTATION; TRUCKS;

APPROXIMATE DYNAMIC PROGRAMMING; FLEET MANAGEMENT; HIGH-DIMENSIONAL; OPERATIONAL ISSUES; OPERATIONAL STATISTICS; REAL WORLD OPERATIONS; SIMULATION MODEL; TRUCKLOAD TRUCKING;

DYNAMIC PROGRAMMING;

EID: 63449141834     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0238     Document Type: Article

References (35)

1. Bertsekas, D., J. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
2. Caliskan, C., R. W. Hall. 2003. A dynamic empty equipment and crew allocation model for long-haul networks. Transportation Res. Part A 5 405-418.
3. Chiu, Y., H. S. Mahmassani. 2002. Hybrid real-time dynamic traffic assignment approach for robust network performance. Transportation Res. Record 1783 89-97.
4. Crainic, T., J. Ferland, J.-M. Rousseau. 1984. A tactical planning model for rail freight transportation. Transportation Sci. 18 165-184.
5. Desaulniers, G., J. Desrosiers, M. Gamache, F. Soumis. 1998. Crew scheduling in air transportation. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Norwell, MA, 169-185.
6. Desrosiers, J., M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. C. Monma, T. Magnanti, M. Ball, eds. Handbooks in Operations Research and Management Science, Network Routing, Vol. 8. North-Holland, Amsterdam, 35-139.
7. Gendreau, M., J. Y. Potvin. 1998. Dynamic vehicle routing and dispatching. T. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Norwell, MA, 115-126.
8. Gendreau, M., F. Guertin, J. Potvin, E. Taillard. 1999. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33 381-390. (Pubitemid 30519518)
9. George, A. 2005. Optimal learning strategies for multi-attribute resource allocation problems. Ph. D. thesis, Princeton University, Princeton, NJ.
10. George, A., W. B. Powell. 2006. Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Machine Learn. 65 167-198.
11. George, A., W. B. Powell, S. Kulkarni. 2005. Value function approximation using hierarchical aggregation for multiattribute resource management. Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ.
12. Ichoua, S., M. Gendreau, J.-Y Potvin. 2006. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. 40 211-225.
13. Kleywegt, A., V. S. Nori, M. W. P. Savelsbergh. 2004. Dynamic programming approximations for a stochastic inventory routing problem. Transporation Sci. 38 42-70.
14. Larsen, A., O. B. G. Madsen, M. M. Solomon. 2002. Partially dynamic vehicle routing-Models and algorithms. J. Oper. Res. Soc. 53 637-646.
15. Marar, A. 2002. Information representation in large-scale resource allocation problems: Theory, algorithms and applications. Ph. D. thesis, Princeton University, Princeton, NJ.
16. Marar, A., W. B. Powell. 2004. Using static flow patterns in time-staged resource allocation problems. Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ.
17. Marar, A., W. B. Powell, S. Kulkarni. 2006. Capturing expert knowledge in resource allocation problems through low-dimensional patterns. IIE Trans. 38 159-172.
18. Powell, W. B. 1988. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. B. Golden, A. Assad, eds. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, 249-292.
19. Powell, W. B. 2007. Approximate Dynamic Programming: Solving the Curses of Dimensionality. John Wiley & Sons, New York.
20. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. C. Monma, T. Magnanti, M. Ball, eds. Handbooks in Operations Research and Management Science, Network Routing, Vol. 8. North-Holland, Amsterdam, 141-295.
21. Powell, W. B., J. A. Shapiro, H. P. Simão. 2001. A representational paradigm for dynamic resource transformation problems. R. F. C. Coullard, J. H. Owens, eds. Annals of Operations Research. J. C. Baltzer AG, Basel, Switzerland, 231-279.
22. Powell, W. B., T. T. Wu, A. Whisman. 2004. Using low dimensional patterns in optimizing simulators: An illustration for the airlift mobility problem. Math. Comput. Model. 29 657-2004.
23. Psaraftis, H. 1995. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61 143-164.
24. Regan, A., H. S. Mahmassani, P. Jaillet. 1998. Evaluation of dynamic fleet management systems-Simulation framework. Transportation Res. Record 1648 176-184.
25. Secomandi, N. 2000. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27 1201-1225.
26. Secomandi, N. 2001. A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49 796-802.
27. Spivey, M. J. 2001. The dynamic assignment problem. Ph. D. thesis, Princeton University, Princeton, NJ.
28. Spivey, M., W. B. Powell. 2004. The dynamic assignment problem. Transportation Sci. 38 399-419.
29. Sutton, R., A. Barto. 1998. Reinforcement Learning. The MIT Press, Cambridge, MA.
30. Tapiero, C., M. Soliman. 1972. Multicommodities transportation schedules over time. Networks 2 311-327.
31. Taylor, G., T. S. Meinert, R. C. Killian, G. L. Whicker. 1999. Development and analysis of alternative dispatching methods in truckload trucking. Transportation Res. Part E 35 191-205.
32. Tjokroamidjojo, E., G. T. Kutanoglu. 2001. Quantifying the value of advance load information in truckload trucking. Technical report, University of Arkansas, Fayetteville.
33. Topaloglu, H., W. B. Powell. 2006. Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. INFORMS J. Comput. 18 31-42.
34. White, W. 1972. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks 2 211-236.
35. Yang, J., P. Jaillet, H. Mahmassani. 2004. Real-time multivehicle truckload pick-up and delivery problems. Transportation Sci. 38 135-148.