Inventory optimization in a retail multi-echelon environment
Name
310355377-MIT.pdf
Description
Full printable version
Size
21.69 MB
Format
Adobe PDF
Checksum (MD5)
245fa88589dd22e22a31c9801cae6057
Author(s)
Arkaresvimun, Rintiya
Advisor(s)
Larry Lapide.
Date Issued
2008
Publisher
Massachusetts Institute of Technology
Abstract
The objective of the study is to find an optimal inventory distribution in a retail three-echelon environment, consisting of a supplier, a DC, and stores. An inventory model is built by replicating the echelons' periodic, order-up-to-level policies with all echelons' transactions integrated. Network carrying cost is set as an objective function, while the store target service level and the store's minimum order-up-to-levels are set as constraints. A heuristic approach, that combines the optimization and simulation methods, is used to find the optimal inventory distribution. The results show that the optimal network carrying cost can be achieved by having low inventory and low service level at the DC. In addition, the impact of the echelons' deviations from the optimal policies as well as the impact of the upstream echelon's service disruptions on the other echelons confirms the interrelation between the echelons in the network. The analyses also illustrate that high target service level can be accomplished by keeping high inventory at the stores and the DC.
Description
Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2008.
Includes bibliographical references (leaf 66).
Subjects
Engineering Systems Division.
MIT Department
Massachusetts Institute of Technology. Engineering Systems Division
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
