DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorTodosijević, Racaen
dc.contributor.authorHanafi, Saïden
dc.date.accessioned2020-05-02T16:41:55Z-
dc.date.available2020-05-02T16:41:55Z-
dc.date.issued2017-09-01en
dc.identifier.issn2192-4406en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2394-
dc.description.abstractVariable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper, we present some of VNS basic schemes as well as several VNS variants deduced from these basic schemes. In addition, the paper includes parallel implementations and hybrids with other metaheuristics.en
dc.publisherSpringer Link-
dc.relation.ispartofEURO Journal on Computational Optimizationen
dc.subjectHeuristic | Metaheuristic | Variable neighborhood searchen
dc.titleVariable neighborhood search: basics and variantsen
dc.typeArticleen
dc.identifier.doi10.1007/s13675-016-0075-xen
dc.identifier.scopus2-s2.0-85014089422en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage423en
dc.relation.lastpage454en
dc.relation.issue3en
dc.relation.volume5en
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
Show simple item record

SCOPUSTM   
Citations

270
checked on Jun 21, 2024

Page view(s)

94
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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