Dual-Sourcing via Dynamic Programming with Monte Carlo Value Approximation
In large scale global supply chains, the inventory cost sensitivity due to supplier disruption can be high. Dual-sourcing, a inventory policy which leverages two suppliers to minimize the cost of supplier disruption, is often applied to minimize the inventory cost in the face of uncertain lead times...
Uloženo v:
| Vydáno v: | International Conference on System Theory, Control and Computing s. 315 - 322 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
10.10.2024
|
| Témata: | |
| ISSN: | 2473-5698 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In large scale global supply chains, the inventory cost sensitivity due to supplier disruption can be high. Dual-sourcing, a inventory policy which leverages two suppliers to minimize the cost of supplier disruption, is often applied to minimize the inventory cost in the face of uncertain lead times and consumer demand. However, computing optimal policies for dual-sourcing faces challenges in modern supply chains due to the large scale of the system. We introduce Dyanmic Programming with Monte Carlo Value Approximation (DPMC), an approximate dynamic programming algorithm with polynomial time complexity which applies Monte Carlo simulation to estimate the optimal value function to address the large scale dual-sourcing problem. We show that DPMC is theoretically guaranteed to converge to the optimal policy by improving the value function approximator and/or increasing the number of Monte Carlo iterations. Via empirical simulation, we demonstrate that DPMC is competitive and often exceeds the cost-minimizing performance of other state-of-the-art dual-sourcing policies, specifically in scenarios where suppliers subject to disruption and/or fixed ordering costs. |
|---|---|
| AbstractList | In large scale global supply chains, the inventory cost sensitivity due to supplier disruption can be high. Dual-sourcing, a inventory policy which leverages two suppliers to minimize the cost of supplier disruption, is often applied to minimize the inventory cost in the face of uncertain lead times and consumer demand. However, computing optimal policies for dual-sourcing faces challenges in modern supply chains due to the large scale of the system. We introduce Dyanmic Programming with Monte Carlo Value Approximation (DPMC), an approximate dynamic programming algorithm with polynomial time complexity which applies Monte Carlo simulation to estimate the optimal value function to address the large scale dual-sourcing problem. We show that DPMC is theoretically guaranteed to converge to the optimal policy by improving the value function approximator and/or increasing the number of Monte Carlo iterations. Via empirical simulation, we demonstrate that DPMC is competitive and often exceeds the cost-minimizing performance of other state-of-the-art dual-sourcing policies, specifically in scenarios where suppliers subject to disruption and/or fixed ordering costs. |
| Author | Liu, Larkin |
| Author_xml | – sequence: 1 givenname: Larkin surname: Liu fullname: Liu, Larkin email: larkin.liu@tum.de organization: Technical University of Munich |
| BookMark | eNo1j0FOwzAURA0CiVJyAxbmACm2v2PHyyqlUFQEUgvbyiTfxSiJIzcFenuCgNmMNIuZN-fkpA0tEnLF2YRzZq4XxWpdFEoYLiaCCTnhTEuplT4iidEmh4yBksLAMRkJqSHNlMnPSLLbvTPGgOtB-Yjcz_a2TldhH0vfbumHt3R2aG3jS_oUwzbapvnJP33_Rh9C2yMtbKwDfbH1Hum062L48o3tfWgvyKmz9Q6TPx-T5_nNurhLl4-3i2K6TD3Xqk95lTtjZTWgATpd5UyCHJAcy16x1CgYgEJAnZXCKWSclU4iqLwCjsZlMCaXv70eETddHObjYfN_H74BRZhRZQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICSTCC62912.2024.10744767 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798350364293 |
| EISSN | 2473-5698 |
| EndPage | 322 |
| ExternalDocumentID | 10744767 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI OCL RIE RIL |
| ID | FETCH-LOGICAL-i176t-1d8f9a4d2933ef7d80434000f05bec7e20336e3e75c2f6e010cf4e368d31e9f53 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001440908400052&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 03:05:29 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i176t-1d8f9a4d2933ef7d80434000f05bec7e20336e3e75c2f6e010cf4e368d31e9f53 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_10744767 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Oct.-10 |
| PublicationDateYYYYMMDD | 2024-10-10 |
| PublicationDate_xml | – month: 10 year: 2024 text: 2024-Oct.-10 day: 10 |
| PublicationDecade | 2020 |
| PublicationTitle | International Conference on System Theory, Control and Computing |
| PublicationTitleAbbrev | ICSTCC |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0003177778 |
| Score | 1.8856225 |
| Snippet | In large scale global supply chains, the inventory cost sensitivity due to supplier disruption can be high. Dual-sourcing, a inventory policy which leverages... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 315 |
| SubjectTerms | Approximation algorithms Costs Dynamic programming Faces Heuristic algorithms Monte Carlo methods Monte Carlo Simulation Polynomials Production Science Sensitivity Supply chains Time complexity |
| Title | Dual-Sourcing via Dynamic Programming with Monte Carlo Value Approximation |
| URI | https://ieeexplore.ieee.org/document/10744767 |
| WOSCitedRecordID | wos001440908400052&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_cEPFpfkz8JoKv3domTdJH6RwqOgabsrfRjwsU5iZzHf755tpu4oMP9imEHIQcyY-73u93ALfCBslpgoljwTi0AUpq30GdoKODhNTLtYXgUsT1WQ0GejIJhzVZveTCIGJZfIYdGpb_8rNFWlCqrEvFg0JJ1YCGUrIia20TKhYI7af34KbW0ew-RqNxFEk_9Ihx5YvOxv5XJ5USSPqtf27hANo_lDw23ILNIezg_Aham54MrL6ix_DUK-KZM6KUvF3H1nnMelXTeTKnUqx3mqf0K3shZSoWxcvZgr3FswLZHSmMf-UVnbENr_37cfTg1P0SnNxTcuV4mTZhLDKL4ByNyrQruL2irnED6ymFvsu5RI4qSH0j0UZiqRHIpc64h6EJ-Ak054s5ngJTXuKnxhOxDDMRW5_pwAQicQVmCq3tGbTpbKYflSTGdHMs53_MX8A-eYAefc-9hOZqWeAV7KbrVf65vC4d-Q2jqp32 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB20inqqHxW_XcFr2iS7yW6OEi2ttqXQKr2VfMxCoLZSm-LPdydpKx48mFNYdkPYYfOYybz3AO6FSZKTGGPLgHFgEpTEfAdVjJbyYlIvVwaCCxHXjuz11GgU9Fdk9YILg4hF8xnW6bb4l5_OkpxKZQ1qHhTSl9uwQ9ZZXknX2pRUDBSaS-3B3UpJs9EOB8Mw9N3AIc6VK-rrJ_zyUimgpFn950scQu2HlMf6G7g5gi2cHkN17crAVof0BJ4f82hiDagob-axZRaxx9J2npZTM9Y7jVMBlnVJm4qF0XwyY2_RJEf2QBrjX1lJaKzBa_NpGLaslWOClTnSX1hOqnQQidRgOEctU2ULbg6prW3PxEqia3PuI0fpJa720eRiiRbIfZVyBwPt8VOoTGdTPAMmndhNtCMiP0hFZKKmPO2J2BaYSjRrz6FGezP-KEUxxuttufhj_Bb2W8NuZ9xp914u4YCiQRDg2FdQWcxzvIbdZLnIPuc3RVC_ARKpoUE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+System+Theory%2C+Control+and+Computing&rft.atitle=Dual-Sourcing+via+Dynamic+Programming+with+Monte+Carlo+Value+Approximation&rft.au=Liu%2C+Larkin&rft.date=2024-10-10&rft.pub=IEEE&rft.eissn=2473-5698&rft.spage=315&rft.epage=322&rft_id=info:doi/10.1109%2FICSTCC62912.2024.10744767&rft.externalDocID=10744767 |