Variable Neighborhood Search
Dragan Urošević (),
Raca Todosijević,
Nenad Mladenović () and
Jack Brimberg ()
Additional contact information
Dragan Urošević: Mathematical Institute of the Serbian Academy of Sciences and Arts
Raca Todosijević: Polytechnic University of Hauts-de-France
Nenad Mladenović: Khalifa University
Jack Brimberg: Department of Mathematics and Computer Science, Royal Military College of Canada
Chapter Chapter 8 in Discrete Diversity and Dispersion Maximization, 2023, pp 151-189 from Springer
Abstract:
Abstract Variable 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 emerge from the corresponding valley. In this chapter, we provide an overview of different VNS variants and describe how they can be used to solve diversity (dispersion) problems. More precisely, we present different neighborhood structures that may be exploited and show how they can be organized within variable neighborhood descent and variable neighborhood search heuristics. Finally, we provide insights on the performance of different VNS methodologies applied to two diversity problems: the maximum diversity problem and the capacitated dispersion problem.
Date: 2023
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-38310-6_8
Ordering information: This item can be ordered from
http://www.springer.com/9783031383106
DOI: 10.1007/978-3-031-38310-6_8
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().