IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v36y2002i1p21-39.html
   My bibliography  Save this article

An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times

Author

Listed:
  • Gregory A. Godfrey

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544)

  • Warren B. Powell

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544)

Abstract

We consider a stochastic version of a dynamic resource allocation problem. In this setting, reusable resources must be assigned to tasks that arise randomly over time. We solve the problem using an adaptive dynamic programming algorithm that uses nonlinear functional approximations that give the value of resources in the future. Our functional approximations are piecewise linear and naturally provide integer solutions. We show that the approximations provide near-optimal solutions to deterministic problems and solutions that significantly outperform deterministic rolling-horizon methods on stochastic problems.

Suggested Citation

  • Gregory A. Godfrey & Warren B. Powell, 2002. "An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times," Transportation Science, INFORMS, vol. 36(1), pages 21-39, February.
    • Handle: RePEc:inm:ortrsc:v:36:y:2002:i:1:p:21-39
    DOI: 10.1287/trsc.36.1.21.570
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.36.1.21.570
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.36.1.21.570?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. William C. Jordan & Mark A. Turnquist, 1983. "A Stochastic, Dynamic Network Model for Railroad Car Distribution," Transportation Science, INFORMS, vol. 17(2), pages 123-145, May.
    2. Z. L. Chen & W. B. Powell, 1999. "Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 497-524, September.
    3. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    4. Raymond K.-M. Cheung & Warren B. Powell, 2000. "Shape -- A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs," Operations Research, INFORMS, vol. 48(1), pages 73-79, February.
    5. Warren B. Powell, 1986. "A Stochastic Model of the Dynamic Vehicle Allocation Problem," Transportation Science, INFORMS, vol. 20(2), pages 117-129, May.
    6. Warren B. Powell & Tassio A. Carvalho, 1998. "Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management," Transportation Science, INFORMS, vol. 32(2), pages 90-109, May.
    7. Linos F. Frantzeskakis & Warren B. Powell, 1990. "A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems," Transportation Science, INFORMS, vol. 24(1), pages 40-57, February.
    8. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    9. Andrzej Ruszczyński, 1987. "A Linearization Method for Nonsmooth Stochastic Programming Problems," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 32-49, February.
    10. Julia L. Higle & Suvrajeet Sen, 1991. "Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 650-669, August.
    11. Powell, Warren B., 1987. "An operational planning model for the dynamic vehicle allocation problem with uncertain demands," Transportation Research Part B: Methodological, Elsevier, vol. 21(3), pages 217-232, June.
    12. Raymond K. Cheung & Warren B. Powell, 1996. "An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management," Operations Research, INFORMS, vol. 44(6), pages 951-963, December.
    13. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    14. Tassio A. Carvalho & Warren B. Powell, 2000. "A Multiplier Adjustment Method for Dynamic Resource Allocation Problems," Transportation Science, INFORMS, vol. 34(2), pages 150-164, May.
    15. Gregory A. Godfrey & Warren B. Powell, 2002. "An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times," Transportation Science, INFORMS, vol. 36(1), pages 40-54, February.
    16. Warren B. Powell, 1989. "A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy," Transportation Science, INFORMS, vol. 23(4), pages 231-243, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Warren Powell & Andrzej Ruszczyński & Huseyin Topaloglu, 2004. "Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 814-836, November.
    2. Bojovic, Nebojsa J., 2002. "A general system theory approach to rail freight car fleet sizing," European Journal of Operational Research, Elsevier, vol. 136(1), pages 136-172, January.
    3. Raymond K.-M. Cheung & Warren B. Powell, 2000. "Shape -- A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs," Operations Research, INFORMS, vol. 48(1), pages 73-79, February.
    4. Song, Haiqing & Huang, Huei-Chuen, 2008. "A successive convex approximation method for multistage workforce capacity planning problem with turnover," European Journal of Operational Research, Elsevier, vol. 188(1), pages 29-48, July.
    5. Warren B. Powell & Michael T. Towns & Arun Marar, 2000. "On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance," Transportation Science, INFORMS, vol. 34(1), pages 67-85, February.
    6. Shi, Ning & Song, Haiqing & Powell, Warren B., 2014. "The dynamic fleet management problem with uncertain demand and customer chosen service level," International Journal of Production Economics, Elsevier, vol. 148(C), pages 110-121.
    7. Felix Papier & Ulrich W. Thonemann, 2008. "Queuing Models for Sizing and Structuring Rental Fleets," Transportation Science, INFORMS, vol. 42(3), pages 302-317, August.
    8. G J King & H Topaloglu, 2007. "Incorporating the pricing decisions into the dynamic fleet management problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1065-1074, August.
    9. Warren B. Powell, 2016. "Perspectives of approximate dynamic programming," Annals of Operations Research, Springer, vol. 241(1), pages 319-356, June.
    10. Huseyin Topaloglu & Warren B. Powell, 2006. "Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 31-42, February.
    11. Raymond K. Cheung & Chuen-Yih Chen, 1998. "A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem," Transportation Science, INFORMS, vol. 32(2), pages 142-162, May.
    12. Huseyin Topaloglu & Warren Powell, 2007. "Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem," Transportation Science, INFORMS, vol. 41(3), pages 281-301, August.
    13. Gregory A. Godfrey & Warren B. Powell, 2002. "An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times," Transportation Science, INFORMS, vol. 36(1), pages 40-54, February.
    14. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
    15. Song, Haiqing & Cheung, Raymond K. & Wang, Haiyan, 2014. "An arc-exchange decomposition method for multistage dynamic networks with random arc capacities," European Journal of Operational Research, Elsevier, vol. 233(3), pages 474-487.
    16. George, David K. & Xia, Cathy H., 2011. "Fleet-sizing and service availability for a vehicle rental system via closed queueing networks," European Journal of Operational Research, Elsevier, vol. 211(1), pages 198-207, May.
    17. Zhou, Shaorui & Zhang, Hui & Shi, Ning & Xu, Zhou & Wang, Fan, 2020. "A new convergent hybrid learning algorithm for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 283(1), pages 33-46.
    18. Gabor, A.F. & Dekker, R. & van Dijk, T. & van Scheepstal, P., 2009. "Scheduling deliveries under uncertainty," ERIM Report Series Research in Management ERS-2009-040-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    19. Fan, Wei & Machemehl, Randy, 2004. "A Multi-stage Monte Carlo Sampling Based Stochastic Programming Model for the Dynamic Vehicle Allocation Problem," 45th Annual Transportation Research Forum, Evanston, Illinois, March 21-23, 2004 208244, Transportation Research Forum.
    20. Gregory D. Glockner & George L. Nemhauser, 2000. "A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure," Operations Research, INFORMS, vol. 48(2), pages 233-242, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:36:y:2002:i:1:p:21-39. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.