DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorHansen, Pierreen
dc.date.accessioned2020-05-02T16:42:17Z-
dc.date.available2020-05-02T16:42:17Z-
dc.date.issued1997-01-01en
dc.identifier.issn0305-0548en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2568-
dc.description.abstractSystematic change of neighborhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a basic scheme for this purpose which can be implemented easily using any local search algorithm as a subroutine. Its effectiveness is illustrated by improvements in the GENIUS algorithm for the traveling salesman problem [1], without and with backhauls [2].en
dc.publisherElsevier-
dc.relationONR, Grant N00014-95-1-0917-
dc.relationNSERC, Grant GPO105574-
dc.relationFCAR, Grant 95ER1048-
dc.relation.ispartofComputers and Operations Researchen
dc.titleVariable neighborhood searchen
dc.typeArticleen
dc.identifier.doi10.1016/S0305-0548(97)00031-2en
dc.identifier.scopus2-s2.0-0031281221en
dc.relation.firstpage1097en
dc.relation.lastpage1100en
dc.relation.issue11en
dc.relation.volume24en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

3,356
checked on Jan 27, 2025

Page view(s)

106
checked on Jan 28, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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