| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mladenović, Nenad | en |
| dc.contributor.author | Hansen, Pierre | en |
| dc.date.accessioned | 2020-05-02T16:42:17Z | - |
| dc.date.available | 2020-05-02T16:42:17Z | - |
| dc.date.issued | 1997-01-01 | en |
| dc.identifier.issn | 0305-0548 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/2568 | - |
| dc.description.abstract | Systematic 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.publisher | Elsevier | - |
| dc.relation | ONR, Grant N00014-95-1-0917 | - |
| dc.relation | NSERC, Grant GPO105574 | - |
| dc.relation | FCAR, Grant 95ER1048 | - |
| dc.relation.ispartof | Computers and Operations Research | en |
| dc.title | Variable neighborhood search | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1016/S0305-0548(97)00031-2 | en |
| dc.identifier.scopus | 2-s2.0-0031281221 | en |
| dc.relation.firstpage | 1097 | en |
| dc.relation.lastpage | 1100 | en |
| dc.relation.issue | 11 | en |
| dc.relation.volume | 24 | en |
| dc.description.rank | M22 | - |
| item.grantfulltext | none | - |
| item.cerifentitytype | Publications | - |
| item.fulltext | No Fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.openairetype | Article | - |
| crisitem.author.orcid | 0000-0001-6655-0409 | - |
SCOPUSTM
Citations
3,423
checked on Apr 24, 2025
Page view(s)
108
checked on Jan 31, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.