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

Página do item simplificado
dc.contributor.authorMasutti T.A.S.
dc.contributor.authorDe Castro L.N.
dc.date.accessioned2024-03-13T00:54:44Z
dc.date.available2024-03-13T00:54:44Z
dc.date.issued2016
dc.description.abstractThe 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.
dc.description.firstpage245
dc.description.lastpage252
dc.identifier.doi10.2316/p.2016.841-029
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36059
dc.relation.ispartofProceedings of the 15th IASTED International Conference on Intelligent Systems and Control, ISC 2016
dc.rightsAcesso Restrito
dc.subject.otherlanguageNatural computing
dc.subject.otherlanguageOptimization
dc.subject.otherlanguageSwarm intelligence
dc.subject.otherlanguageTraveling salesman problem
dc.titleParameter analysis of a bee-inspired algorithm to solve the traveling salesman problem
dc.typeArtigo de evento
local.scopus.citations1
local.scopus.eid2-s2.0-85015409486
local.scopus.subjectBee-inspired algorithms
local.scopus.subjectDefault values
local.scopus.subjectNatural Computing
local.scopus.subjectParameter analysis
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85015409486&origin=inward
Arquivos
Coleções
Artigo de evento