TSPoptBees: A Bee-Inspired Algorithm to Solve the Traveling Salesman Problem

被引：6

作者：

Masutti, Thiago A. S. ^{[1
]}

de Castro, Leandro Nunes ^{[1
]}

机构：

[1] Univ Prebiteriana Mackenzie, Grad Program Elect Engn & Comp, Nat Comp Lab LCoN, Sao Paulo, Brazil

来源：

PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016 | 2016年

关键词：

traveling salesman problem; natural computing; swarm intelligence; bee-inspired algorithm;

D O I：

10.1109/IIAI-AAI.2016.148

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The Traveling Salesman Problem (TSP) is a combinatorial optimization problem widely used to test new heuristics. Bee-inspired algorithms are receiving great attention from the Swarm Intelligence field due to their capability of providing good solutions in reasonable time to complex problems. This paper takes the optBees, a bee-inspired algorithm used for continuous optimization, and proposes the necessary modifications to solve the TSP, generating the TSPoptBees. The proposed algorithm is evaluated using benchmark instances and the results are compared to other similar works from the literature.

引用

页码：593 / 598

页数：6