کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
391925 664567 2016 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Less is more: Basic variable neighborhood search for minimum differential dispersion problem
ترجمه فارسی عنوان
کمتر است: جستجوی متغیر اساسی متغیر برای حداقل اختلاف پراکندگی اختلاف
کلمات کلیدی
بهینه سازی، پراکندگی دیفرانسیل، ابتکاری، متغیر جستجوی محله
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 326, 1 January 2016, Pages 160–171
نویسندگان
, , ,