首页|期刊导航|哈尔滨工业大学学报（英文版）|Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain
哈尔滨工业大学学报（英文版）2004，Vol.11Issue(5)：573-578,6.
Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain
Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain
摘要
Abstract
In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location fac-tories to minimize the total costs of production, inventory and transportation under the system capacity restriction and product due date, while at the same time considering the menu distributed balance, the mathematical pro-gramming models are decomposed and reduced from the 3 levels into 2 levels according to the idea of just-in-time production. In order to overcome the premature convergence of ACA (ant colony algorithms) , the idea of mute operation is adopted in genetic algorithms and a PACA (parallel ant colony algorithms) is proposed forsupply chain optimization. Finally, an illustrative example is given, and a comparison is made with standard BAR ( Branch and Bound) and PACA approach. The result shows that the latter is more effective and promis-ing.关键词
multi-location factories/supply chain/capacitated lot sizing/ant colony algorithmKey words
multi-location factories/supply chain/capacitated lot sizing/ant colony algorithm分类
信息技术与安全科学引用本文复制引用
李树刚,吴智铭,庞小红..Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain[J].哈尔滨工业大学学报（英文版）,2004,11(5):573-578,6.基金项目
Sponsored by the National Natural Science Foundation of China ( Grant No. 70071017 and 59889505) and Open Foundation of State Key Laboratory for Manufacturing Systems Engineering( Xi' An). （ Grant No. 70071017 and 59889505）
