Journals / Konya Mühendislik Bilimleri Dergisi / 2023 / Cilt: 11 Sayı: 3

A DISCRETE PARTICLE SWARM ALGORITHM WITH SYMMETRY METHODS FOR DISCRETE OPTIMIZATION PROBLEMS

AYRI OPTİMİZASYON PROBLEMLERİ İÇİN SİMETRİ YÖNTEMLİ AYRIK BİR PARÇACIK SÜRÜSÜ ALGORİTMASI

Pages
610–634
Publication Date
2023-09-01
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)

The results showed that the performance of DPSO has improved with the symmetry method and it has achieved better results than the discrete heuristic algorithms recently proposed in the literature.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Particle Swarm Optimization (PSO) is a commonly used optimization to solve many problems.
📊
Key Findings & Data:The variations of the DPSO occurred according to the selected method type (DPSO1 (swap method), DPSO2 (shift method), DPSO3 (swap and shift methods), DPSO4 (symmetry method), DPSO5 (swap, shift, and symmetry methods), DPSO6 (swap, shift, symmetry, and 2-opt methods)).
💡
Conclusion & Impact:The results showed that the performance of DPSO has improved with the symmetry method and it has achieved better results than the discrete heuristic algorithms recently proposed in the literature.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Takas · Kaydırma · Simetri

Abstract

Particle Swarm Optimization (PSO) is a commonly used optimization to solve many problems. The PSO, which is developed for continuous optimization, is updated to solve discrete problems and Discrete PSO (DPSO) is obtained in this study. With DPSO, the Traveling Salesman Problem (TSP), which is well-known in the literature as a discrete problem, is solved. In order to improve the results, the swap method, the shift method, and the symmetry method are added to DPSO. The symmetry method is a new and successful method. The variations of the DPSO occurred according to the selected method type (DPSO1 (swap method), DPSO2 (shift method), DPSO3 (swap and shift methods), DPSO4 (symmetry method), DPSO5 (swap, shift, and symmetry methods), DPSO6 (swap, shift, symmetry, and 2-opt methods)). The effect of each method on the performance of the DPSO has been studied in detail. To demonstrate the success of the variations of the DPSO, the results are additionally compared with many well-known and new discrete algorithms in the literature. The results showed that the performance of DPSO has improved with the symmetry method and it has achieved better results than the discrete heuristic algorithms recently proposed in the literature.

Özet

Parçacık Sürü Optimizasyonu (PSO), birçok problemi çözmek için yaygın olarak kullanılan bir optimizasyon yöntemidir. Bu çalışmada sürekli optimizasyon problemleri için geliştirilen PSO, ayrık optimizasyon problemleri çözmek için tekrar güncellenmiştir. Böylece Ayrık PSO (DPSO) elde edilmiştir. DPSO ile literatürde ayrık bir problem olarak bilinen Gezgin Satıcı Problemi (GSP) çözülmüştür. Sonuçları iyileştirmek için DPSO'ya takas yöntemi, kaydırma yöntemi ve simetri yöntemi eklenmiştir. Simetri yöntemi yeni ve başarılı bir yöntemdir. DPSO varyasyonları seçilen yöntem türüne (DPSO1 (takas yöntemi), DPSO2 (kaydırma yöntemi), DPSO3 (takas ve kaydırma yöntemi), DPSO4 (simetri yöntemi), DPSO5 (takas, kaydırma ve simetri yöntemleri), DPSO6 (takas, kaydırma, simetri ve 2 seçenekli yöntemler)). Her yöntemin DPSO'nun performansı üzerindeki etkisi ayrıntılı olarak incelenmiştir. DPSO'nun varyasyonlarının başarısını göstermek için, sonuçlar ayrıca literatürdeki birçok iyi bilinen ve yeni ayrık optimizasyon algoritmalarıyla karşılaştırılmıştır. Sonuçlar, simetri yöntemi ile DPSO'nun performansının arttığını ve literatürde son zamanlarda önerilen ayrık sezgisel algoritmalardan daha iyi sonuçlar elde ettiğini göstermiştir.

🔖

Cite This Article

BAŞ, E., YILDIZDAN, G. (2023). A DISCRETE PARTICLE SWARM ALGORITHM WITH SYMMETRY METHODS FOR DISCRETE OPTIMIZATION PROBLEMS. Konya Mühendislik Bilimleri Dergisi, Cilt: 11 Sayı: 3, 610–634. https://ajindex.com/articles/959617

📄 Full Text PDF Viewer

📄

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

References (10)

  1. R. Eberhard, J. Kennedy, “A New Optimizer Using Particle Swarm Theory,” Proceedings of 1995 IEEE 6th International Symposium, pp. 39 – 43. M. Mahi, Ö.K. Baykan, H. Kodaz, “A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem,” Applied Soft Computing, vol. 30, pp. 484-490, 2015.
  2. Ş. Öztürk, R. Ahmad, N. Akhtar, “Variants of Artificial Bee Colony algorithm and its applications in medical image processing,” Applied Soft Computing, vol. 97, Part A, pp. 106799, 2020.
  3. F. A. Hashim, A. G. Hussien, “Snake Optimizer: A novel meta-heuristic optimization algorithm,” Knowledge-Based Systems, vol. 242, pp. 108320, 2022.
  4. T. S. L. V. Ayyarao, N. S. S. Ramakrishna, R. M. Elavarasan, N. Polumahanthi, M. Rambabu, G. Saini, B.Khan, B.Alatas, "War Strategy Optimization Algorithm: A New Effective Metaheuristic Algorithm for Global Optimization," in IEEE Access, vol. 10, pp. 25073-25105, 2022. D. Połap, M. Woźniak, “Red fox optimization algorithm,” Expert Systems with Applications, vol. 166, pp. 114107, 2021. L. Yi, “Study on an Improved PSO Algorithm and its Application for Solving Function Problem,” International Journal of Smart Home, vol. 10, no. 3, pp. 51 – 62, 2016.
  5. W. Deng, R. Chen, B. He, Y.Q. Liu, L. F. Yin, J. H. Guo, “A novel two-stage hybrid swarm intelligence optimization algorithm and application,” Soft Computing, vol. 16, no. 10, pp. 1707-1722, 2012.
  6. W. Deng, H. M. Zhao, J. J. Liu, X. L. Yan, Y. Y. Li, L. F. Yin, C. H. Ding, “An improved CACO algorithm based on adaptive method and multi-variant strategies,” Soft Computing, vol. 19 no. 3, pp. 701- 713, 2015.
  7. X. H. Shi, Y. Zhou, L. M. Wang, Q. X. Wang, Y. C. Liang, “A Discrete Particle Swarm Optimization Algorithm for Travelling Salesman Problem,” Computational Methods, 2006, pp. 1063–1068.
  8. O. E. Turgut, M. S. Turgut, M. T. Coban, “Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations,” Computers and Mathematics with Applications, vol. 68, no. 4, pp. 508-530, 2014. Z. L. Gaing, "Discrete particle swarm optimization algorithm for unit commitment," 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491), 2003, pp. 418-424.
  9. A. Unler, A. Murat, “A discrete particle swarm optimization method for feature selection in binary classification problems,” vol. 206, no. 3, pp. 528-539, 2010.
  10. S. Strasser, R. Goodman, J. Sheppard, S. Butcher, “A New Discrete Particle Swarm Optimiza