IDEAS home Printed from https://ideas.repec.org/a/hin/jjopti/960879.html
   My bibliography  Save this article

Dynamic Optimization Technique for Distribution of Goods with Stochastic Shortages

Author

Listed:
  • Charles I. Nkeki

Abstract

This work considers the distribution of goods with stochastic shortages from factories to stores. It is assumed that in the process of shipping the goods to various stores, some proportion of the goods will be damaged (which will lead to shortage of goods in transit). The cost of the damaged goods is added to the cost of the shipment. A proportion of the total expected cost of the shortage goods is assumed to be recovered and should be deducted from the total cost of the shipment. In order to determine the minimum transportation costs for the operation, we adopt dynamic optimization principles. The optimal transportation cost and optimal control policies of shipping the goods from factories to stores were obtained. We find that the optimal costs of the goods recovered could be determined. It was further found that the optimum costs of distributing the goods with minimum and maximum error bounds coincide only at infinity.

Suggested Citation

  • Charles I. Nkeki, 2013. "Dynamic Optimization Technique for Distribution of Goods with Stochastic Shortages," Journal of Optimization, Hindawi, vol. 2013, pages 1-12, December.
    • Handle: RePEc:hin:jjopti:960879
    DOI: 10.1155/2013/960879
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/7179/2013/960879.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/7179/2013/960879.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/960879?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. Huseyin Topaloglu & Sumit Kunnumkal, 2006. "Approximate dynamic programming methods for an inventory allocation problem under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 822-841, December.
    2. 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.
    3. Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
    4. 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.
    5. 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.
    6. John M. Mulvey & Andrzej Ruszczyński, 1995. "A New Scenario Decomposition Method for Large-Scale Stochastic Optimization," Operations Research, INFORMS, vol. 43(3), pages 477-490, June.
    7. John M. Mulvey & Hercules Vladimirou, 1992. "Stochastic Network Programming for Financial Planning Problems," Management Science, INFORMS, vol. 38(11), pages 1642-1664, 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. 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.
    2. 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.
    3. Dong‐Ping Song & Jonathan Carter, 2008. "Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(2), pages 156-171, March.
    4. Warren B. Powell, 2016. "Perspectives of approximate dynamic programming," Annals of Operations Research, Springer, vol. 241(1), pages 319-356, June.
    5. Yan, Pengyu & Yu, Kaize & Chao, Xiuli & Chen, Zhibin, 2023. "An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1218-1233.
    6. José Carbajal & Alan Erera & Martin Savelsbergh, 2013. "Balancing fleet size and repositioning costs in LTL trucking," Annals of Operations Research, Springer, vol. 203(1), pages 235-254, March.
    7. R. Baldacci & M. Boschetti & N. Christofides & S. Christofides, 2009. "Exact methods for large-scale multi-period financial planning problems," Computational Management Science, Springer, vol. 6(3), pages 281-306, August.
    8. 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.
    9. Christine Fricker & Nicolas Gast, 2016. "Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 261-291, August.
    10. Luke Schenk & Diego Klabjan, 2008. "Intramarket Optimization for Express Package Carriers," Transportation Science, INFORMS, vol. 42(4), pages 530-545, November.
    11. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    12. Sumit Kunnumkal & Huseyin Topaloglu, 2008. "A duality‐based relaxation and decomposition approach for inventory distribution systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 612-631, October.
    13. 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.
    14. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    15. Felix Papier & Ulrich W. Thonemann, 2008. "Queuing Models for Sizing and Structuring Rental Fleets," Transportation Science, INFORMS, vol. 42(3), pages 302-317, August.
    16. Miguel Andres Figliozzi & Hani S. Mahmassani & Patrick Jaillet, 2007. "Pricing in Dynamic Vehicle Routing Problems," Transportation Science, INFORMS, vol. 41(3), pages 302-318, August.
    17. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    18. Cheung, Bernard K.-S. & Choy, K.L. & Li, Chung-Lun & Shi, Wenzhong & Tang, Jian, 2008. "Dynamic routing model and solution methods for fleet management with mobile technologies," International Journal of Production Economics, Elsevier, vol. 113(2), pages 694-705, June.
    19. Alexander S. Estes & Michael O. Ball, 2021. "Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 785-807, May.
    20. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.

    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:hin:jjopti:960879. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.