用蚁群算法解决动态设施布置问题  

Using Ant Colony Algorithm to Solve the Problem of Dynamic Facilities Layout

作　　者：张亚南[1] 阚树林[1] 王越[1] 

机构地区：[1]上海大学机电工程与自动化学院,上海200072

出　　处：《工业工程》2007年第2期107-111,共5页Industrial Engineering Journal

基　　金：上海市高等学校科学技术发展基金资助项目(04AB46);上海市重点学科建设资助项目(Y0102)

摘　　要：给出了动态设施布置的数学模型,介绍了一种解决组合优化问题的有效算法——蚁群算法,并用该算法成功地解决了某汽车零件制造厂生产车间的设施布置问题,得到了优良的解决方案,证明了该算法的优越性。The mathematical model of DFLP is presented and an efficient algorithm, called ant colony algorithm, is introduced for solving combinational optimization problem. This method successfully solve the facility layout problem for a production shop of an auto parts manufactory. A good layout planning is obtained. The advantages of this algorithm are proved.

关 键 词：设施布置 蚁群算法 动态 

分 类 号：O22[理学—运筹学与控制论]