Skip to Main content Skip to Navigation
Journal articles

Less is more: Basic variable neighborhood search for minimum differential dispersion problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03400764
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 10:37:05 AM
Last modification on : Wednesday, November 3, 2021 - 5:24:24 AM

Identifiers

Collections

Citation

Nenad Mladenovic, Raca Todosijević, Dragan Urošević. Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Information Sciences, Elsevier, 2016, 326, pp.160-171. ⟨10.1016/j.ins.2015.07.044⟩. ⟨hal-03400764⟩

Share

Metrics

Record views

6