{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/57550"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/57550","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems","abstract":"We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.","abstract_html":"We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.","abstract_has_math":false,"creators":["Yu, Qian, S.M. Massachusetts Institute of Technology"],"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":["Restef Levi."],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010","date_published":"2010","updated_at":"2026-07-22T22:21:09Z","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/57550","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Restef 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":["Yu, Qian, S.M. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-08-26T15:23:25Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-08-26T15:23:25Z"]},{"key":"dc:date.issued","label":"Date","values":["2010"]},{"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/57550"]}]},{"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, 2010.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student submitted PDF version of thesis.","Includes bibliographical references (p. 67-68)."]},{"key":"dc:description.abstract","label":"Abstract","values":["We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.","(cont.) The dual-balancing policy can be modified in several ways to get other cost balancing policies. It has been proven that the dual-balancing policy has a worst-case guarantee of 2 but this does not indicate the empirical performance. An approximately optimal policy is considered as the benchmark to test the quality of the cost balancing policies. In the computational experiments, the dual-balancing policy shows an average error of 7.74% compared to the approximately optimal policy, much better than the theoretical worst-case guarantee. The three variants of cost balancing policies have made significant improvement on the performance of the dual-balancing policy. The accuracy of the dual-balancing policy is also affected by the system parameters. In addition, with high demand rate and long lead times, we have observed several scenarios when the cost balancing policies dominate the approximately optimal policy."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Restef 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":["Yu, Qian, S.M. Massachusetts Institute of Technology"],"dc:date.accessioned":["2010-08-26T15:23:25Z"],"dc:date.available":["2010-08-26T15:23:25Z"],"dc:date.issued":["2010"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2010.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student submitted PDF version of thesis.","Includes bibliographical references (p. 67-68)."],"dc:description.abstract":["We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.","(cont.) The dual-balancing policy can be modified in several ways to get other cost balancing policies. It has been proven that the dual-balancing policy has a worst-case guarantee of 2 but this does not indicate the empirical performance. An approximately optimal policy is considered as the benchmark to test the quality of the cost balancing policies. In the computational experiments, the dual-balancing policy shows an average error of 7.74% compared to the approximately optimal policy, much better than the theoretical worst-case guarantee. The three variants of cost balancing policies have made significant improvement on the performance of the dual-balancing policy. The accuracy of the dual-balancing policy is also affected by the system parameters. In addition, with high demand rate and long lead times, we have observed several scenarios when the cost balancing policies dominate the approximately optimal policy."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/57550"],"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":["Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:09Z"}