DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:13Z-
dc.date.available2020-05-02T16:42:13Z-
dc.date.issued2006-04-01en
dc.identifier.issn0166-218Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2536-
dc.description.abstractWhen applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first improvement, if the initial solution is chosen at random. However, starting with 'greedy' or 'nearest neighbor' constructive heuristics, the best improvement is better and faster on average. Reasons for this behavior are investigated. It appears to be better to use exchanges introducing into the solution a very small edge and fairly large one, which can easily be removed later, than two small ones which are much harder to remove.en
dc.publisherElsevier-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.subjectHeuristic | Metaheuristic | Travelling salesman | Variable neighborhood searchen
dc.titleFirst vs. best improvement: An empirical studyen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2005.05.020en
dc.identifier.scopus2-s2.0-33644593839en
dc.relation.firstpage802en
dc.relation.lastpage817en
dc.relation.issue5 SPEC. ISS.en
dc.relation.volume154en
dc.description.rankM22-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

84
checked on Jun 22, 2024

Page view(s)

51
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.