首页> 外文会议>Parallel and distributed processing >Parallel ANt COlonies for Combinatorial Optimization Problems
【24h】

Parallel ANt COlonies for Combinatorial Optimization Problems

机译:组合优化问题的并行ANt菌落

获取原文
获取原文并翻译 | 示例

摘要

Ant Colonies optimization take inspiration from the behavior for real ant oclonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem. Parallelism demonstrates that cooperaton between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance ocmputing is feasible to solve large optimization problems.
机译:蚁群优化从实际蚁群的行为中获得启发,以解决优化问题。本文提出了一种蚁群并行模型来解决二次分配问题。并行性表明,通信主体之间的合作可以改善在解决QAP中获得的结果。它还表明,高性能运算对于解决大型优化问题是可行的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号