arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.04324cs.NEcs.AI
收藏

旅行商问题的随机密钥布谷鸟搜索

Random-Key Cuckoo Search for the Travelling Salesman Problem

School of Science and Technology, Middlesex University(密德萨斯大学科学与技术学院)

Aziz Ouaarab, B. Ahiod, Xin-She Yang

摘要:

组合优化问题是典型的NP难问题,因此非常具有挑战性。本文提出了求解旅行商问题的随机密钥布谷鸟搜索算法。我们使用了一个简化的随机密钥编码方案,从连续空间(实数)传递到组合空间。我们还考虑了位移的解决方案,在这两个空间使用Levy航班。建议RKCS的性能进行测试对一组基准的对称TSP从著名的TSPLIB库。测试结果表明,RKCS优于其他一些元启发式算法。

英文摘要:

Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in both spaces using Levy flights. The performance of the proposed RKCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that RKCS is superior to some other metaheuristic algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑