2026-09-19T07:29:05Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/550812022-01-13T07:54:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
James B. Orlin and David Simchi-Levi.
Xiao, Qinwen
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Massachusetts Institute of Technology. Computation for Design and Optimization Program
2010-05-25T20:39:36Z
2010-05-25T20:39:36Z
2009
2009
http://hdl.handle.net/1721.1/55081
587497475
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
One of the major challenges in supply chain management is the level of information availability. It is very hard yet important to coordinate each stage in the supply chain when the information is not centralized and the demand is uncertain. In this thesis, I analyzed the bullwhip effect in supply chain management using the MIT Beer Distribution Game. I also proposed heuristics and models to optimize the MIT Beer Distribution Game order policy when the customer's demand is both known and unknown. The proposed model provides each player with an order policy based on how many weeks of inventory the player needs to keep ahead to minimize the global cost of the supply chain. The optimized order policy is robust, practical, and generated by numerical simulations. The model is applied in a number of experiments involving deterministic and random demand and lead time. The simulation results of my work are compared with two other artificial agent algorithms, and the improvements brought by my results are presented and analyzed.
by Qinwen Xiao.
S.M.
64 p.
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Computation for Design and Optimization Program.
Optimizing beer distribution game order policy using numerical simulations
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4b486bff-a24b-437b-8ce6-f261126a8d8a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Optimizing beer distribution game order policy using numerical simulations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2009</PublicationDate>
<Authors>
<Author>
<DisplayName>Xiao, Qinwen</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Computation for Design and Optimization Program.</Keyword>
<Abstract>One of the major challenges in supply chain management is the level of information availability. It is very hard yet important to coordinate each stage in the supply chain when the information is not centralized and the demand is uncertain. In this thesis, I analyzed the bullwhip effect in supply chain management using the MIT Beer Distribution Game. I also proposed heuristics and models to optimize the MIT Beer Distribution Game order policy when the customer's demand is both known and unknown. The proposed model provides each player with an order policy based on how many weeks of inventory the player needs to keep ahead to minimize the global cost of the supply chain. The optimized order policy is robust, practical, and generated by numerical simulations. The model is applied in a number of experiments involving deterministic and random demand and lead time. The simulation results of my work are compared with two other artificial agent algorithms, and the improvements brought by my results are presented and analyzed.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>