|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||A general framework for nested variable neighborhood search||Journal:||Electronic Notes in Discrete Mathematics||Volume:||58||First page:||159||Last page:||166||Conference:||4th International Conference on Variable Neighborhood Search||Issue Date:||1-Apr-2017||Rank:||M30||DOI:||10.1016/j.endm.2017.03.021||Abstract:||
In this paper we review a recently proposed variant of variable neighborhood search (VNS) referred to as nested variable neighborhood search (NVNS) and propose a generalization of this approach. In addition, we develop a heuristic stemming from this general framework and apply it on the capacitated clustering problem (CCP). Based on obtained results the proposed heuristic outperforms the current state-of-the-art for the CCP.
|Keywords:||capacitated clustering problem | Nested variable neighborhood search | variable neighborhood descent||Publisher:||Elsevier|
Show full item record
checked on Sep 27, 2021
checked on Sep 26, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.