首页> 中文期刊> 《计算机工程》 >基于二元蚁群算法的多目标订单分配问题求解

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

         

摘要

为了在最小化综合成本的同时尽量均衡企业的生产负荷以及为水平型制造协作联盟(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.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号