کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
495027 862812 2015 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A novel hybrid adaptive collaborative approach based on particle swarm optimization and local search for dynamic optimization problems
ترجمه فارسی عنوان
یک رویکرد مشارکتی سازگار با هیبرید جدید بر مبنای بهینه سازی ذرات و جستجوی محلی برای مشکلات بهینه سازی پویا
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


• We propose a hybrid collaborative model based on fuzzy social-only particle swarm optimization and local search methods for dynamic optimization problems.
• We examine the performance of the proposed model on moving peaks benchmark (MPB) which is one of the most widely used benchmarks in the literature.
• We further extend the basic algorithm using novel resource management schemes, i.e. competition and hibernation, to improve the performance of the basic model.
• We investigate the influence of different components and parameters on the performance of the proposed algorithms.
• We propose the performance comparison between the proposed method and several well-known and recently proposed models.

This paper proposes a novel hybrid approach based on particle swarm optimization and local search, named PSOLS, for dynamic optimization problems. In the proposed approach, a swarm of particles with fuzzy social-only model is frequently applied to estimate the location of the peaks in the problem landscape. Upon convergence of the swarm to previously undetected positions in the search space, a local search agent (LSA) is created to exploit the respective region. Moreover, a density control mechanism is introduced to prevent too many LSAs crowding in the search space. Three adaptations to the basic approach are then proposed to manage the function evaluations in the way that are mostly allocated to the most promising areas of the search space. The first adapted algorithm, called HPSOLS, is aimed at improving PSOLS by stopping the local search in LSAs that are not contributing much to the search process. The second adapted, algorithm called CPSOLS, is a competitive algorithm which allocates extra function evaluations to the best performing LSA. The third adapted algorithm, called CHPSOLS, combines the fundamental ideas of HPSOLS and CPSOLS in a single algorithm. An extensive set of experiments is conducted on a variety of dynamic environments, generated by the moving peaks benchmark, to evaluate the performance of the proposed approach. Results are also compared with those of other state-of-the-art algorithms from the literature. The experimental results indicate the superiority of the proposed approach.

Figure optionsDownload as PowerPoint slide

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 32, July 2015, Pages 432–448
نویسندگان
, , , ,