碩士 / 國立交通大學 / 運輸與物流管理學系 / 101 / The conventional Joint Replenishment Problem (JRP) considers the following cost terms: (1) major setup cost, (2) minor setup cost and (3) holding cost. This study focuses on the extension of the JRP by taking into account the container transportation cost and the capacity constraints of the material handling facilities. We formulate a mathematical model for the concerned problem. Also, we conduct theoretical analysis for the transportation cost with respect to the number of required containers and the value of the basic period. Our theoretical results facilitate in proposing a search procedure for seeking an optimal and feasible basic period for a given set of multipliers. By encoding the set of multipliers, we propose a genetic algorithm (GA) that incorporates with the proposed search procedure. Following our numerical experiments, we conclude that the proposed GA is an effective solution approach that obtains excellent solutions for the concerned JRP.
| Identifer | oai:union.ndltd.org:TW/101NCTU5423003 |
| Date | January 2013 |
| Creators | Chen, Jiun-Yi, 陳均宜 |
| Contributors | Yao, Ming-Jong, Lin, Jen-Yen, 姚銘忠, 林仁彥 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 71 |
Page generated in 0.0092 seconds