A New Algorithm for One-Warehouse Multi-Retailer Systems under Stationary-Nested Policy

• Main Authors: Wang, Yu-Chun, 王昱鈞
• Other Authors: Hu, Kun-Te
• Format: Others
• Language: en_US
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/76835926771567308189

碩士 === 東海大學 === 工業工程學系 === 91 === This study aims at optimally coordinating inventory among all the partners in a supply chain system with a central warehouse and multiple local retailers so as to minimize the average total costs. After reviewing the literature, we found no study proposes an efficient solution approach that guarantees to secure an optimal solution for the one-warehouse multi-retailer lot-sizing problem. The solution approaches in the literature share a common problem, namely, they do not have insights into the optimality structure of the problem. Therefore, this study first focuses on performing a full theoretical analysis on the optimality structure. Then, by utilizing our theoretical results, we derive an effective search algorithm that is able to obtain an optimal solution for the one-warehouse multi-retailer lot-sizing problem under stationary-nested policy. Based on our random experiments, we demonstrate that our search algorithm out-performs the other heuristics.