Solving the Joint Replenishment Problem with Warehouse-Space Restrictions Using a Genetic Algorithm
This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts warehouse-space restrictions.The focus of this study is to determine the lot size of each product under power-of-two policy to minimize the total cost per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to solve this problem, we propose a hybrid genetic algorithm (HGA). We utilize the ability of multi-dimensional search of GA to obtain candidates in the solution space, and test the feasibility of any candidate using the proposed heuristics. By our numerical experiments,we demonstrate that the proposed HGA could effectively solve the JRP with warehouse-space restrictions. Therefore, it could serve as an effective decision-support tool for the logistic managers.
Inventory joint replenishment problem scheduling genetic algorithm warehouse space
Ming-Jong Yao
Department of Industrial Engineering and Enterprise Information, Tunghai University,180, Sec.3, Taichung-Kang Road, Taichung City, 40704 Taiwan, R.O.C.
国际会议
第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)
武汉
英文
302-307
2007-08-03（万方平台首次上网日期，不代表论文的发表时间）