|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Developments of variable neighborhood search||Journal:||Operations Research : Computer Science Interfaces Series||Volume:||15||First page:||415||Last page:||439||Issue Date:||1-Dec-2002||ISBN:||978-1-4615-1507-4||ISSN:||1387-666X||DOI:||10.1007/978-1-4615-1507-4_19||Abstract:||
Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic change of neighborhood within a possibly randomized local search. Its development has been rapid. After reviewing the basic scheme of VNS, several extensions aimed at solving large problem instances are surveyed. Issues in devising a VNS heuristic are discussed. Finally, recent applications are briefly summarized, with special attention given to VNS-based computer-aided discovery of conjectures in graph theory.
Show full item record
checked on Dec 2, 2021
checked on Dec 3, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.