首页> 外文会议>Evolutionary computation in combinatorial optimization >Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
【24h】

Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm

机译:基于人口的进化算法对旅行商问题的精确解

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

摘要

This articles introduces a (μ + 1)-EA, which is proven to be an exact TSP problem solver for a population of exponential size. We will show non-trivial upper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an NP-hard problem is solved exactly instead of approximated only by a black box algorithm.
机译:本文介绍了(μ+1)-EA,它已被证明是针对指数大小总体的精确TSP问题求解器。我们将在运行时显示不平凡的上限,直到找到最佳解决方案为止。据我们所知,这是首次证明精确解决NP难题,而不是仅通过黑匣子算法来解决。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号