On the exploration and exploitation in popular swarm-based metaheuristic algorithms
It is obvious from wider spectrum of successful applications that metaheuristic algorithms are potential solutions to hard optimization problems. Among such algorithms are swarm-based methods like particle swarm optimization and ant colony optimization which are increasingly attracting new researche...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Springer
2018
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.uthm.edu.my/3465/1/AJ%202018%20%28348%29.pdf http://eprints.uthm.edu.my/3465/ https://doi.org/10.1007/s00521-018-3592-0 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | It is obvious from wider spectrum of successful applications that metaheuristic algorithms are potential solutions to hard optimization problems. Among such algorithms are swarm-based methods like particle swarm optimization and ant colony optimization which are increasingly attracting new researchers. Despite popularity, the core questions on performance issues are still partially answered due to limited insightful analyses. Mere investigation and comparison of end results may not reveal the reasons behind poor or better performance. This study, therefore, performed in-depth empirical analysis by quantitatively analyzing exploration and exploitation of five swarm-based metaheuristic algorithms. The analysis unearthed explanations the way algorithms performed on numerical problems as well as on real-world application of classification using adaptive neuro-fuzzy inference system (ANFIS) trained by selected metaheuristics. The outcome of empirical study suggested that coherence and consistency in the swarm individuals throughout iterations is the key to success in swarmbased metaheuristic algorithms. The analytical approach adopted in this study may be employed to perform componentwise diversity analysis so that the contribution of each component on performance may be determined for devising efficient search strategies. |
|---|