DC FieldValueLanguage
dc.contributor.authorMjirda, Anisen
dc.contributor.authorTodosijević, Racaen
dc.contributor.authorHanafi, Saïden
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:41:56Z-
dc.date.available2020-05-02T16:41:56Z-
dc.date.issued2017-05-01en
dc.identifier.issn0969-6016en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2404-
dc.description.abstractIn a single local search algorithm, several neighborhood structures are usually explored. The simplest way is to define a single neighborhood as the union of all predefined neighborhood structures; the other possibility is to make an order (or sequence) of the predefined neighborhoods, and to use them in the first improvement or the best improvement fashion, following that order. In this work, first we classify possible variants of sequential use of neighborhoods and then, empirically analyze them in solving the classical traveling salesman problem (TSP). We explore the most commonly used TSP neighborhood structures, such as 2-opt and insertion neighborhoods. In our empirical study, we tested 76 different such heuristics on 15,200 random test instances. Several interesting observations are derived. In addition, the two best of 76 heuristics (used as local searches within a variable neighborhood search) are tested on 23 test instances taken from the TSP library (TSPLIB). It appears that the union of neighborhoods does not perform well.en
dc.publisherWiley-
dc.relation.ispartofInternational Transactions in Operational Researchen
dc.subjectempirical study | neighborhood structures | TSP | variable neighborhood descent | variable neighborhood searchen
dc.titleSequential variable neighborhood descent variants: an empirical study on the traveling salesman problemen
dc.typeArticleen
dc.identifier.doi10.1111/itor.12282en
dc.identifier.scopus2-s2.0-84963831400en
dc.relation.firstpage615en
dc.relation.lastpage633en
dc.relation.issue3en
dc.relation.volume24en
dc.description.rankM21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-9321-3464-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

58
checked on Jun 15, 2024

Page view(s)

67
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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