Authors: Mladenović, Nenad 
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Less is more: Basic variable neighborhood search for minimum differential dispersion problem
Journal: Information Sciences
Volume: 326
First page: 160
Last page: 171
Issue Date: 1-Jan-2016
Rank: M21a
ISSN: 0020-0255
DOI: 10.1016/j.ins.2015.07.044
In this paper, we propose a basic variable neighborhood search for solving Minimum differential dispersion problem using only the swap neighborhood structure in both descent (intensification) and shaking (diversification) steps. It has become a trend in the metaheuristic literature to use hybrid metaheuristics, i.e., combination of several metaheuristic paradigms, for solving some particular optimization problem. We show that our simple method, which relies on the basic Variable neighborhood search, significantly outperforms the hybrid one that combines GRASP, Variable neighborhood search, and Exterior path relinking metaheuristics. Thus, simplicity is not only the desired user friendly property of a heuristic but can lead to more efficient and effective method than if complex hybrid metaheuristic is used: less is more.
Keywords: Differential dispersion | Heuristic | Optimization | Variable neighborhood search
Publisher: Elsevier
Project: Ministry of Education and Science, Republic of Kazakhstan, project number 0115PK00546
Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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