{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/55081"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/55081","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Optimizing beer distribution game order policy using numerical simulations","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_html":"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_has_math":false,"creators":["Xiao, Qinwen"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Computation for Design and Optimization Program.","school":null,"contributors":[],"advisors":["James B. Orlin and David Simchi-Levi."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:21:16Z","subjects":["Computation for Design and Optimization Program."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/55081","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["James B. Orlin and David Simchi-Levi."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."]},{"key":"dc:creator","label":"Author","values":["Xiao, Qinwen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-05-25T20:39:36Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-05-25T20:39:36Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computation for Design and Optimization Program."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/55081"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Optimizing beer distribution game order policy using numerical simulations"]}]}],"canonical_facts":{"dc:contributor.advisor":["James B. Orlin and David Simchi-Levi."],"dc:contributor.department":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."],"dc:contributor.other":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."],"dc:creator":["Xiao, Qinwen"],"dc:date.accessioned":["2010-05-25T20:39:36Z"],"dc:date.available":["2010-05-25T20:39:36Z"],"dc:date.issued":["2009"],"dc:description":["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)."],"dc:description.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."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/55081"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Computation for Design and Optimization Program."],"dc:title":["Optimizing beer distribution game order policy using numerical simulations"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:16Z"}