Parameter analysis of a bee-inspired algorithm to solve the traveling salesman problem

Tipo
Artigo de evento
Data de publicação
2016
Periódico
Proceedings of the 15th IASTED International Conference on Intelligent Systems and Control, ISC 2016
Citações (Scopus)
1
Autores
Masutti T.A.S.
De Castro L.N.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
The Traveling Salesman Problem (TSP) is extensively used to test new algorithms that tackle combinatorial optimiza-tion problems. Bee inspired algorithms are receiving a con-siderable attention from the Swarm Intelligence field. This paper presents the TSPoptBees, a bee inspired algorithm to solve the TSP. A vast discussion is made in regards to the parameter analysis of the proposed algorithm, showing trends on varying certain parameters and proposing default values for them. The quality is assessed using instances from the TSPLIB and the results show the algorithm is able to provide good quality solutions.
Descrição
Palavras-chave
Assuntos Scopus
Bee-inspired algorithms , Default values , Natural Computing , Parameter analysis
Citação
DOI (Texto completo)
10.2316/p.2016.841-029
URI
https://dspace.mackenzie.br/handle/10899/36059
Coleções
Artigo de evento