A two-phase metaheuristic approach for solving Economic Lot Scheduling Problems

International Journal of Operational Research(2009)

引用 10|浏览3
暂无评分
摘要
In this paper, economic lot scheduling problem is investigated using time-varying lot sizes approach. The process of finding the best production sequence consists of two-phase implementation of metaheuristics. In the first phase, we propose a genetic algorithm that makes use of the proposed new lower bound to arrive at the good set of production frequencies of products for ELSP without/with backorders. In the second phase, the best sequence of part production is achieved by using the above set of frequencies and employing a GA and an ant-colony algorithm. Computational experiments reveal the effectiveness of the two-phase approach over the conventional single-phase approach.
更多
查看译文
关键词
gas,metaheuristics,lower bound,ant colony algorithm,genetic algorithm,economic lot scheduling problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要