An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
Published Online:1 Feb 2002https://doi.org/10.1287/trsc.36.1.40.572
References
- A multiplier adjustment method for dynamic resource-allocation problems. Transportation Sci. (2000) 34:150–164Link, Google Scholar
- An adaptive, distributionfree approximation for the newsvendor problem with censored demands, with applications to inventory and distribution problems. Management Sci. (2001) 47(8)–1112Link, Google Scholar
- An adaptive, dynamic programming algorithm for dynamic fleet management, I: Single period travel times. Transportation Sci. (2002) 36(1Google Scholar
- The fleet assignment problem: Solving a large scale integer program. Math. Programming (1995) 70:211–232Crossref, Google Scholar
- A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transportation Sci. (1989) 23(4):231–243Link, Google Scholar
- Dynamic control of logistics queueing network for large-scale fleet management. Transportation Sci. (1998) 32(2):90–109Link, Google Scholar
- Airline fleet assignment with time windows. Transportation Sci. (2000) 34(1):1–20Link, Google Scholar
- Advances in the optimization of airline fleet assignment. Transportation Sci. (1997) 31:159–169Link, Google Scholar
- The dynamic assignment problem. (2000) . Technical Report CL-00-03, Department of Operations Research and Financial Engineering, Princeton University. Princeton, NJGoogle Scholar
- Network models for fleet management. Decision Sci. (1989) 20:182–197Crossref, Google Scholar

