dc.creatorBuriol, L
dc.creatorFranca, PM
dc.creatorMoscato, P
dc.date2004
dc.dateSEP
dc.date2014-11-13T23:47:03Z
dc.date2015-11-26T16:03:14Z
dc.date2014-11-13T23:47:03Z
dc.date2015-11-26T16:03:14Z
dc.date.accessioned2018-03-28T22:52:31Z
dc.date.available2018-03-28T22:52:31Z
dc.identifierJournal Of Heuristics. Springer, v. 10, n. 5, n. 483, n. 506, 2004.
dc.identifier1381-1231
dc.identifierWOS:000224561700002
dc.identifier10.1023/B:HEUR.0000045321.59202.52
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76297
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/76297
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/76297
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265227
dc.descriptionThis paper introduces a new memetic algorithm specialized for the asymmetric instances of the traveling salesman problem (ATSP). The method incorporates a new local search engine and many other features that contribute to its effectiveness, such as: (i) the topological organization of the population as a complete ternary tree with thirteen nodes; (ii) the hierarchical organization of the population in overlapping clusters leading to the special selection scheme; (iii) efficient data structures. Computational experiments are conducted on all ATSP instances available in the TSPLIB, and on a set of larger asymmetric instances with known optimal solutions. The comparisons show that the results obtained by our method compare favorably with those obtained by several other algorithms recently proposed for the ATSP.
dc.description10
dc.description5
dc.description483
dc.description506
dc.languageen
dc.publisherSpringer
dc.publisherDordrecht
dc.publisherHolanda
dc.relationJournal Of Heuristics
dc.relationJ. Heuristics
dc.rightsfechado
dc.rightshttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dc.sourceWeb of Science
dc.subjectasymmetric traveling salesman problem
dc.subjectlocal search
dc.subjectmemetic algorithms
dc.subjectmetaheuristics
dc.subjectSearch
dc.titleA new memetic algorithm for the asymmetric traveling salesman problem
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución