An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application
Published Online:15 Aug 2008https://doi.org/10.1287/trsc.1080.0238
References
- Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
- A dynamic empty equipment and crew allocation model for long-haul networks. Transportation Res. Part A (2003) 5:405–418Google Scholar
- Hybrid real-time dynamic traffic assignment approach for robust network performance. Transportation Res. Record (2002) 1783:89–97Crossref, Google Scholar
- A tactical planning model for rail freight transportation. Transportation Sci. (1984) 18:165–184Link, Google Scholar
- , Crainic T. G., Laporte G. Crew scheduling in air transportation. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Norwell, MA) 169–185Crossref, Google Scholar
- , 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
- , Crainic T., Laporte G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Norwell, MA) 115–126Crossref, Google Scholar
- Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
- Optimal learning strategies for multi-attribute resource allocation problems. (2005) . Ph.D. thesis, Princeton University, Princeton, NJGoogle Scholar
- Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Machine Learn. (2006) 65:167–198Crossref, Google Scholar
- 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
- Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40:211–225Link, Google Scholar
- Dynamic programming approximations for a stochastic inventory routing problem. Transporation Sci. (2004) 38:42–70Link, Google Scholar
- Partially dynamic vehicle routing—Models and algorithms. J. Oper. Res. Soc. (2002) 53:637–646Crossref, Google Scholar
- Information representation in large-scale resource allocation problems: Theory, algorithms and applications. (2002) . Ph.D. thesis, Princeton University, Princeton, NJGoogle Scholar
- 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
- Capturing expert knowledge in resource allocation problems through low-dimensional patterns. IIE Trans. (2006) 38:159–172Crossref, Google Scholar
- , 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
- Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007) (John Wiley & Sons, New York) Crossref, Google Scholar
- , 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
- , 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
- Using low dimensional patterns in optimizing simulators: An illustration for the airlift mobility problem. Math. Comput. Model. (2004) 29:657–2004Crossref, Google Scholar
- Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
- Evaluation of dynamic fleet management systems—Simulation framework. Transportation Res. Record (1998) 1648:176–184Crossref, Google Scholar
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. (2000) 27:1201–1225Crossref, Google Scholar
- A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. (2001) 49:796–802Link, Google Scholar
- The dynamic assignment problem. (2001) . Ph.D. thesis, Princeton University, Princeton, NJGoogle Scholar
- The dynamic assignment problem. Transportation Sci. (2004) 38:399–419Link, Google Scholar
- Reinforcement Learning (1998) (The MIT Press, Cambridge, MA) Google Scholar
- Multicommodities transportation schedules over time. Networks (1972) 2:311–327Crossref, Google Scholar
- Development and analysis of alternative dispatching methods in truckload trucking. Transportation Res. Part E (1999) 35:191–205Crossref, Google Scholar
- Quantifying the value of advance load information in truckload trucking. (2001) . Technical report, University of Arkansas, FayettevilleGoogle Scholar
- Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. INFORMS J. Comput. (2006) 18:31–42Link, Google Scholar
- Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2:211–236Crossref, Google Scholar
- Real-time multivehicle truckload pick-up and delivery problems. Transportation Sci. (2004) 38:135–148Link, Google Scholar

