SavedAdd your journal

Journals / Selçuk Üniversitesi Mühendislik Bilim ve Teknoloji Dergisi / 2018 / Cilt: 6 - Sayı: 4

AN ENSEMBLE INERTIA WEIGHT CALCULATION STRATEGY IN PARTICLE SWARM OPTIMIZATION ALGORITHM

Parçacık Sürü Optimizasyon Algoritmasında Bir Topluluk Atalet Ağırlığı Hesaplama Stratejisi

İbrahim Berkan AYDİLEK
Pages
544–558
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Proposed ensemblestrategy is proven by statistical tests and gives successful results in all optimization benchmark testproblems.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The ultimate success of particle swarm optimization depends on the velocity values ofprevious particles.
📊
Key Findings & Data:Velocity is multiplied with inertia weight coefficient, and has a significant effect onsearch capability of the particle swarm optimization.
💡
Conclusion & Impact:Proposed ensemblestrategy is proven by statistical tests and gives successful results in all optimization benchmark testproblems.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

The ultimate success of particle swarm optimization depends on the velocity values ofprevious particles. Velocity is multiplied with inertia weight coefficient, and has a significant effect onsearch capability of the particle swarm optimization. When looking at previous studies that are carriedout to calculate this coefficient, it is seen that inertia weight coefficient has been handled in several ways.In this article; a new ensemble inertia weight calculation strategy is proposed that uses other constant,random, linear decreasing, global local best, simulated annealing and chaotic inertia weight calculationmethods. Other methods results are combined and used to make a final output decision in a proper way.In experimental tests, 30 common optimization benchmark test problems are used. Proposed ensemblestrategy is proven by statistical tests and gives successful results in all optimization benchmark testproblems.

Özet

Parçacık sürüsü optimizasyonunun nihai başarısı, önceki parçacıkların hız değerlerine bağlıdır. Hız, atalet ağırlık katsayısı ile çarpılır ve parçacık sürüsü optimizasyonunun arama yeteneği üzerinde önemli bir etkiye sahiptir. Bu katsayıyı hesaplamak için yapılan önceki çalışmalara bakıldığında atalet ağırlık katsayısının çeşitli şekillerde ele alındığı görülmektedir. Bu makalede; diğer sabit, rasgele, doğrusal azalan, küresel yerel en iyi, benzetimli tavlama ve kaotik atalet ağırlığı hesaplama yöntemlerini kullanılan yeni bir topluluk atalet ağırlığı hesaplama stratejisi önerilmiştir. Önerilen yöntemde, diğer yöntemlerin sonuçları uygun bir şekilde birleştirilerek nihai çıktı kararı üretmek için kullanılmaktadır. Deneysel testlerde, bilinen 30 optimizasyon kıyaslama test problemi kullanılmaktadır. Önerilen topluluk stratejisi istatistiksel testlerle kanıtlanmış ve tüm optimizasyon kıyaslama test problemlerinde başarılı sonuçlar vermiştir

🔖

Cite This Article

AYDİLEK, İ. B. (2022). AN ENSEMBLE INERTIA WEIGHT CALCULATION STRATEGY IN PARTICLE SWARM OPTIMIZATION ALGORITHM. Selçuk Üniversitesi Mühendislik Bilim ve Teknoloji Dergisi, Cilt: 6 - Sayı: 4, 544–558. https://ajindex.com/articles/592125

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. Ala’raj, M., Abbod, M.F., 2016, “Classifiers Consensus System Approach for Credit Scoring”, KnowledgeBased Systems, Vol. 104, pp. 89-105, doi:10.1016/j.knosys.2016.04.013 Al-Hassan, W., Fayek, M.B., Shaheen, S.I., “Psosa: An Optimized Particle Swarm Technique for Solving the Urban Planning Problem”, In Computer Engineering and Systems, The 2006
  2. International Conference on, Cairo, Egypt, pp. 401–405 5-7 Nov. 2006, IEEE, 2007.
  3. Arasomwan, M.A., Adewumi, A.O., 2013, “On the Performance of Linear Decreasing Inertia Weight Particle Swarm Optimization for Global Optimization”, The Scientific World Journal. 2013.
  4. Armano, G., Farmani, M.R., 2016, “Multiobjective Clustering Analysis Using Particle Swarm Optimization”, Expert Systems with Applications, Vol. 55, pp. 184–193, doi:10.1016/j.eswa.2016.02.009 Arumugam, M.S., Rao, MVC., 2006, “On the Performance of the Particle Swarm Optimization Algorithm with Various Inertia Weight Variants for Computing Optimal Control of a Class of Hybrid Systems”, Discrete Dynamics in Nature and Society. Awad, N. H., Ali, M. Z., Liang, J. J., Qu, B. Y., Suganthan P. N., Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Bound Constrained RealParameter Numerical Optimization, Technical Report, Nanyang Technological University, Singapore, November 2016.
  5. Bansal, J.C., Singh, P.K., Saraswat, M., Verma, A., Jadon, S.S., Abraham, A., 2011, “Inertia Weight Strategies in Particle Swarm Optimization”, In: Proceedings of Third World Congress on Nature and Biologically Inspired Computing (NaBIC-2011),
  6. Salamanca, Spain, pp 633–640, 19-21 October. 2011.
  7. Bharti, K.K., Singh, P.K., 2016, “Opposition Chaotic Fitness Mutation Based Adaptive Inertia Weight BPSO for Feature Selection in Text Clustering”, Applied Soft Computing, Vol. 43, pp. 20-34.
  8. Çavdar, T., 2016, “PSO Tuned ANFIS Equalizer Based on Fuzzy C-means Clustering Algorithm”, AEU - International Journal of Electronics and Communications, Vol. 70(6), pp. 799–807, doi:10.1016/j.aeue.2016.03.006. Eberhart, R.C., Shi, Y., “Tracking and Optimizing Dynamic Systems with Particle Swarms”, In Evolutionary Computation, 2001. Proceedings of the 2001
  9. Congress on, Seoul, South Korea, Vol. 1, pp. 94–100, 27-30 May 2001.
  10. Feng, Y., Teng, G.F., Wang, A.X., Yao, Y.M., “Chaotic Inertia Weight in Particle Swarm Optimization”, In Innovative Computing, Information and Control, Kumamoto, Japan, 2007. ICICIC’07. Second International Conference on, page 47