含再制造的受限批量问题求解的蚁群算法  

ANT COLONIES ALGORITHM FOR SOLVING CAPACITATED LOT-SIZING PROBLEM WITH REMANUFACTURING

作　　者：马艳[1] 黄玲[2] 苏守宝[1] 

机构地区：[1]皖西学院信息工程系,安徽六安237012 [2]解放军电子工程学院,安徽合肥230037

出　　处：《计算机应用与软件》2011年第2期96-99,共4页Computer Applications and Software

基　　金：安徽省自然科学基金项目(090416249);安徽省人文社科项目(2006sk008)

摘　　要：研究企业制造/再制造的混合生产场景,建立含再制造的库存能力受限的混合批量模型;根据问题模型的特性设计启发式蚁群算法进行求解;通过对提出的算法进行仿真实验,以验证所提算法的有效性和效率,并对参数值的选择问题做了一些探讨。In this paper,the scene of mixed manufacturing/remanufacturing is studied,and the mixed lot-sizing model with remanufacturing and capacitated inventory capacity is built.According to the characteristic of problematical model,a heuristic ant colonies algorithm is designed to find the solution.Simulation experiment on the proposed algorithm is carried out for attesting the validity and efficiency of the algorithm,and the parameter value selection issues are discussed as well.

关 键 词：受限批量问题 蚁群算法 再制造 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]