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

详细信息    查看全文

• 作者：Nenad Mladenovi膰 ; ^a ; ^b ; ^c ; ^{nenadmladenovic12@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; ^{nenad@mi.sanu.ac.rs" class="auth_mail" title="E-mail the corresponding author} ; ^{nenadmladenovi02@yahoo.com" class="auth_mail" title="E-mail the corresponding author} ; Raca Todosijevi膰^b ; ^c ; ^{racatodosijevic@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Dragan Uro&scaron ; evi膰^c ; ^{draganu@turing.mi.sanu.ac.rs" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Optimization ; Differential dispersion ; Heuristic ; Variable neighborhood search
• 刊名：Information Sciences
• 出版年：2016
• 出版时间：1 January 2016
• 年：2016
• 卷：326
• 期：Complete
• 页码：160-171
• 全文大小：330 K

文摘

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.