中国机械工程2012，Vol.23Issue(19)：2326-2331,6.DOI:10.3969/j.issn.1004-132X.2012.19.012
蚁群算法在单级多时段多资源约束的生产批量问题中的应用研究
Application of an Improved Ant Colony Optimization Algorithm for Solving Single-level Multi-period Capacitated Dynamic Lot-sizing Problem
摘要
Abstract
One algorithm structure of an ant colony optimization(ACO) for solving multi -periods continuous and mixed integer programming problem was first designed herein and then its application in the single-level multi -period capacitated dynamic lot-sizing problem(CLSP) was introduced. The algorithm was based on the model characteristics of CLSP and improvements of traditional ant colony algorithm. Compared with other algorithms of other literature, the algorithm presented herein performs better than that the traditional genetic algorithm and the hybrid of simulated annealing penalty and genetic algorithm do;it has higher ability of obtaining optimal value. The application results show the method is feasible and effective for solving this kind problem.关键词
生产批量计划/多资源约束/蚁群算法/混合整数规划Key words
dynamic lot -sizing problem/multiple resource constraint/ant colony algorithm/mixed integer programming分类
管理科学引用本文复制引用
李英俊,陈志祥..蚁群算法在单级多时段多资源约束的生产批量问题中的应用研究[J].中国机械工程,2012,23(19):2326-2331,6.基金项目
国家自然科学基金资助项目(70972079) （70972079）
