Heuristics for Base‐Stock Levels in Multi‐Echelon Distribution Networks. Issue 9 (13th June 2017)
- Record Type:
- Journal Article
- Title:
- Heuristics for Base‐Stock Levels in Multi‐Echelon Distribution Networks. Issue 9 (13th June 2017)
- Main Title:
- Heuristics for Base‐Stock Levels in Multi‐Echelon Distribution Networks
- Authors:
- Rong, Ying
Atan, Zümbül
Snyder, Lawrence V. - Abstract:
- Abstract : We study inventory optimization for locally controlled, continuous‐review distribution systems with stochastic customer demands. Each node follows a base‐stock policy and a first‐come, first‐served allocation policy. We develop two heuristics, the recursive optimization (RO) heuristic and the decomposition‐aggregation (DA) heuristic, to approximate the optimal base‐stock levels of all the locations in the system. The RO heuristic applies a bottom‐up approach that sequentially solves single‐variable, convex problems for each location. The DA heuristic decomposes the distribution system into multiple serial systems, solves for the base‐stock levels of these systems using the newsvendor heuristic of Shang and Song (2003), and then aggregates the serial systems back into the distribution system using a procedure we call "backorder matching." A key advantage of the DA heuristic is that it does not require any evaluation of the cost function (a computationally costly operation that requires numerical convolution). We show that, for both RO and DA, changing some of the parameters, such as leadtime, unit backordering cost, and demand rate, of a location has an impact only on its own local base‐stock level and its upstream locations' local base‐stock levels. An extensive numerical study shows that both heuristics perform well, with the RO heuristic providing more accurate results and the DA heuristic consuming less computation time. We show that both RO and DA areAbstract : We study inventory optimization for locally controlled, continuous‐review distribution systems with stochastic customer demands. Each node follows a base‐stock policy and a first‐come, first‐served allocation policy. We develop two heuristics, the recursive optimization (RO) heuristic and the decomposition‐aggregation (DA) heuristic, to approximate the optimal base‐stock levels of all the locations in the system. The RO heuristic applies a bottom‐up approach that sequentially solves single‐variable, convex problems for each location. The DA heuristic decomposes the distribution system into multiple serial systems, solves for the base‐stock levels of these systems using the newsvendor heuristic of Shang and Song (2003), and then aggregates the serial systems back into the distribution system using a procedure we call "backorder matching." A key advantage of the DA heuristic is that it does not require any evaluation of the cost function (a computationally costly operation that requires numerical convolution). We show that, for both RO and DA, changing some of the parameters, such as leadtime, unit backordering cost, and demand rate, of a location has an impact only on its own local base‐stock level and its upstream locations' local base‐stock levels. An extensive numerical study shows that both heuristics perform well, with the RO heuristic providing more accurate results and the DA heuristic consuming less computation time. We show that both RO and DA are asymptotically optimal along multiple dimensions for two‐echelon distribution systems. Finally, we show that, with minor changes, both RO and DA are applicable to the balanced allocation policy. … (more)
- Is Part Of:
- Production and operations management. Volume 26:Issue 9(2017)
- Journal:
- Production and operations management
- Issue:
- Volume 26:Issue 9(2017)
- Issue Display:
- Volume 26, Issue 9 (2017)
- Year:
- 2017
- Volume:
- 26
- Issue:
- 9
- Issue Sort Value:
- 2017-0026-0009-0000
- Page Start:
- 1760
- Page End:
- 1777
- Publication Date:
- 2017-06-13
- Subjects:
- distribution network -- multi‐echelon supply chain -- inventory -- heuristics -- asymptotic analysis
Production management -- Periodicals
658.505 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 ↗
http://www.poms.org/journal ↗
http://www3.interscience.wiley.com/journal/121568272/home ↗
http://onlinelibrary.wiley.com/ ↗
http://www.umi.com/pqdauto/ ↗ - DOI:
- 10.1111/poms.12717 ↗
- Languages:
- English
- ISSNs:
- 1059-1478
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6853.076600
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 4730.xml