An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application

Published Online:https://doi.org/10.1287/trsc.1080.0238

References

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