基于二元蚁群算法的多目标订单分配问题求解  

Solution of Multi-objective Order Allocation Problem Based on Binary Ant Colony Algorithm

作　　者：叶青[1] 熊伟清[1] 江宝钏[1] 

机构地区：[1]宁波大学电子商务与物流研究所,浙江宁波315211

出　　处：《计算机工程》2011年第3期175-177,182,共4页Computer Engineering

基　　金：浙江省自然科学基金资助项目(Y1080363);宁波市自然科学基金资助项目(2007A610051)

摘　　要：为了在最小化综合成本的同时尽量均衡企业的生产负荷以及为水平型制造协作联盟(HMCA)订单分配的管理工作提供依据,设计多种群混合行为二元蚁群算法,用于求解HMCA订单分配的多目标模型。该方法在二元蚁群算法的基础上引入区域划分、环境评价与奖励策略,以弥补二元蚁群算法难以同时寻找多个解的缺陷,通过引入中心扰动行为,进一步提高求解质量。实验结果表明,该算法可以保证分布性,且求解质量较高。In order to provide the basis for the management of allocating orders in Horizontal Manufacturing Collaborative Alliance（HMCA）, this paper designs an algorithm named Multi-population Binary Ant Colony Algorithm with Hybrid Behaviors（MPBAHB） to minimize the comprehensive cost and balance the production loads among the selected manufacturing enterprises. Based on Binary Ant Colony Algorithm （BACA）, two strategies of zoning and environmental evaluation/reward are introduced to conquer the drawback of original BACA of difficult to get multiple solutions. And a searching behavior named ＂central disturbing＂ is introduced to BACA, so as to strengthen the searching ability. Experimental results prove that the algorithm can get better solutions while keeping the distribution of Pareto front.

关 键 词：多目标订单分配 二元蚁群算法 多种群 环境评价 混合行为 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]