首页> 外文会议>2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference >Research on Ant Colony algorithm for the QAP-based facility layout problems
【24h】

Research on Ant Colony algorithm for the QAP-based facility layout problems

机译:基于QAP的设施布局问题的蚁群算法研究

获取原文

摘要

In this paper, we propose a variant of the QAP-based facility layout problem: the exclusion facility layout problem (EFLP). Based on Ant Colony algorithm, we design the modified ant algorithm for solving the facility layout problem (FLP). In addition, we also design the ant algorithm for EFLP by increasing the operator of making solution feasible. Analyze the impact of the different parameters values on the results by a lot of data testing. Experimental results show that the algorithm has strong capability of global search and rapid speed of convergence.
机译:在本文中,我们提出了一个基于QAP的设施布局问题的变体:排除设施布局问题(EFLP)。基于蚁群算法,设计了改进的蚁群算法来解决设施布局问题。此外,我们还通过增加使解决方案可行的运算符来设计EFLP的蚂蚁算法。通过大量数据测试,分析不同参数值对结果的影响。实验结果表明,该算法具有较强的全局搜索能力和收敛速度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号