TSPoptBees: 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:52:36Z
dc.date.available2024-03-13T00:52:36Z
dc.date.issued2016
dc.description.abstract© 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.
dc.description.firstpage593
dc.description.lastpage598
dc.identifier.doi10.1109/IIAI-AAI.2016.148
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/35938
dc.relation.ispartofProceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016
dc.rightsAcesso Restrito
dc.subject.otherlanguageBee-inspired algorithm
dc.subject.otherlanguageNatural computing
dc.subject.otherlanguageSwarm intelligence
dc.subject.otherlanguageTraveling salesman problem
dc.titleTSPoptBees: A bee-inspired algorithm to solve the traveling salesman problem
dc.typeArtigo de evento
local.scopus.citations7
local.scopus.eid2-s2.0-84988843552
local.scopus.subjectBee-inspired algorithms
local.scopus.subjectCombinatorial optimization problems
local.scopus.subjectComplex problems
local.scopus.subjectContinuous optimization
local.scopus.subjectNatural Computing
local.scopus.subjectSwarm Intelligence
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84988843552&origin=inward
Arquivos
Coleções
Artigo de evento