TSPoptBees: A bee-inspired algorithm to solve the traveling salesman problem
Tipo
Artigo de evento
Data de publicação
2016
Periódico
Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016
Citações (Scopus)
7
Autores
Masutti T.A.S.
De Castro L.N.
De Castro L.N.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
© 2016 IEEE.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.
Descrição
Palavras-chave
Assuntos Scopus
Bee-inspired algorithms , Combinatorial optimization problems , Complex problems , Continuous optimization , Natural Computing , Swarm Intelligence