• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Asian Transport Studies >Ant Colony Optimization with Path Relinking for the Capacitated Arc Routing Problem
【24h】

Ant Colony Optimization with Path Relinking for the Capacitated Arc Routing Problem

机译：带路径重新链接的蚁群优化算法用于电容电弧路由问题

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has wide applicability in real-world logistics problems. The CARP involves finding a set of routes with minimum costs for a set of demand arcs with vehicle capacity limitations. Due to its NP-hard property, the CARP cannot be solved within reasonable time by exact algorithms. In recent years, metaheuristic algorithms have been developed to solve the CARP. Here, we propose an ant colony optimization algorithm with path relinking (ACOPR) to solve the problem. The proposed ACOPR was tested with seven benchmark sets of 181 instances from the literature for its effectiveness and compared with the existing best-performing metaheuristics. The computational results show that ACOPR is competitive with the compared state-of-the-art metaheuristic algorithms.
机译：电容弧布线问题（CARP）是一个困难的组合优化问题，在现实世界的物流问题中具有广泛的适用性。 CARP涉及为具有车辆容量限制的一组需求弧找到成本最低的一组路线。由于其具有NP-hard属性，因此无法通过精确算法在合理的时间内解决CARP。近年来，已经开发了元启发式算法来解决CARP。在这里，我们提出了一种具有路径重新链接（ACOPR）的蚁群优化算法来解决该问题。拟议的ACOPR已通过文献中的181个实例的七个基准测试了其有效性，并与现有表现最佳的元启发式算法进行了比较。计算结果表明，ACOPR与最先进的元启发式算法相比具有竞争力。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号