Journals / Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi / 2021 / Cilt: 12 - Sayı: Ek (Suppl.) 1

Analysis of a Hybrid Whale Optimization Algorithm for Traveling Salesman Problem

Bir Hibrid Balina Optimizasyon Algoritminin Gezgin Satıcı Problemi için Analizi

Pages
469–476
Publication Date
2021-12-31
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 show that the hybrid algorithm (WOA+NN) outperforms AS (Ant system), WOA, GA, and SA for 50% of all datasets.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Whale Optimization Algorithm (WOA) is a fairly new algorithm developed in 2016.
📊
Key Findings & Data:However, WOA demonstrates lower performance than others in traveling salesman problems.
💡
Conclusion & Impact:The results show that the hybrid algorithm (WOA+NN) outperforms AS (Ant system), WOA, GA, and SA for 50% of all datasets.
🔬Design:Modeling & Simulation
📍Scope:2016 Verileri
⚙️Variables:Hibrid algoritma · gezgin satıcı problemi · balina optimizasyon algoritması

Abstract

Whale Optimization Algorithm (WOA) is a fairly new algorithm developed in 2016. WOA was applied to continuous optimization problems and engineering problems in the literature. However, WOA demonstrates lower performance than others in traveling salesman problems. Therefore, in this study, an application of the hybrid algorithm (WOA+NN) has been done in the traveling salesman problem. A set of classical datasets which have cities scale ranged from 51 to 150 was used in the application. The results show that the hybrid algorithm (WOA+NN) outperforms AS (Ant system), WOA, GA, and SA for 50% of all datasets. Ant system (AS) is the second algorithm that is better than other metaheuristics for 40% of all datasets. In addition, it was given that a detailed analysis presents the number of best, worst, average solutions, standard deviation, and the average CPU time concerning meta-heuristics. The metrics stress that the hybrid algorithm (WOA+NN) demonstrates a performance rate over 50% in finding optimal solutions. AS (Ant system) is better at 40% of all optimal solutions. Finally, the hybrid algorithm solves the discrete problem in reasonable times in comparison to other algorithms for medium-scale datasets.

Özet

Balina optimizasyon algoritması (WOA) 2016 yılında geliştirilmiş olan oldukça yeni bir algoritmadır. Balina optimizasyon algoritması literatürde sürekli optimizasyon problemlerine ve mühendislik problemlerine uygulanmıştır. Buna rağmen, WOA gezgin satıcı probleminde diğer algoritmalardan daha düşük performans sergilemektedir. Bu yüzden, bu çalışmada, hibrid algoritmanın (WOA+NN) gezgin satıcı problem üzerinde bir uygulaması yapılmaktadır. Uygulamada 51-150 arasında ölçekli şehirlerden oluşan bir klasik veriseti kullanılmıştır. Sonuçlar, hibrid algoritmanın (WOA+NN), AS (Karınca sistemi), WOA, GA ve SA’dan tüm verisetlerinin %50’sinde üstün olduğunu göstermektedir. Karınca sistemi ise tüm verisetlerinin %40’ında diğer meta-sezgisellerden daha olumlu sonuç veren ikinci algoritmadır. Çalışmada, detaylı bir analiz verilerek meta-sezgisellere göre en iyi, en kötü, ortalama çözümler, standart sapma ve ortalama CPU zamanı sunulmaktadır. Metrikler, hibrid algoritmanın (WOA+NN) optimal çözümleri bulmada %50’nin üzerinde performans sergilediğini göstermektedir. Karınca sistemi (AS) ise, tüm çözümlerin %40’ında daha iyidir. Sonuç olarak, hibrid algoritma orta ölçekli verisetlerinde diğer algoritmalara kıyasla kesikli problemi kabul edilebilir zamanlarda çözmektedir.

🔖

Cite This Article

DEMİRAL, M. F. (2021). Analysis of a Hybrid Whale Optimization Algorithm for Traveling Salesman Problem. Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Cilt: 12 - Sayı: Ek (Suppl.) 1, 469–476. https://ajindex.com/articles/790095

📄 Full Text PDF Viewer

📄

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

References (12)

  1. Abdel-Basset, M., El-Shahat, D., Sangaiah, A.K. (2019). A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem. International Journal of Machine Learning and Cybernetics, 10: 495–514.
  2. Ahmed, O. M. A., Kahramanlı, H. (2018). Meta-Heuristic Solution Approaches for Traveling Salesperson Problem. International Journal of Applied Mathematics Electronics and Computers, 6(3): 21-26.
  3. Algabalawy, M.A., Abdelaziz, A.Y., Mekhamer, S.F., Abdel Aleem, S.H.E. (2010). Considerations on optimal design of hybrid power generation systems using whale and sine cosine optimization algorithms. Journal of Electrical Systems and Information Technology, 5(3): 312-325.
  4. Alp, O., Erkut, E., Drezner, Z. (2003). An Efficient Genetic Algorithm for the P-Median Problem. Annals of Operations Research, 122(1-4): 21-42.
  5. Arnaout, J.P. (2014). Worm optimization: A novel optimization algorithm inspired by C. Elegans. Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management, Bali, Indonesia, 2499-2505.
  6. Bozorgi, S.M., Yazdani, S. (2019). IWOA: An improved whale optimization algorithm for optimization problems. Journal of Computational Design and Engineering, 6(3): 243–259. Cárdenas-Montes, M. (2018). Creating hard-to-solve instances of travelling salesman problem. Applied Soft Computing, 71: 268-276.
  7. Cherkesly, M., Desaulniers, G., Irnich, S., Laporte, G. (2016). Branch-price-and cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European Journal of Operational Research, 250: 782-793.
  8. Demiral, M.F., Işik, A.H. (2020). Simulated annealing algorithm for a medium-sized tsp data. In: Artificial Intelligence and Applied Mathematics in Engineering Problems. Hemanth, D.J., Kose, U. (eds.), Springer, Cham, 457-465.
  9. Elloumi, W., Abed, H. E., Abraham, A., Alimi, A.M. (2014). A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP. Applied Soft Computing, 25: 234–241.
  10. Halim, A.H., Ismail, I. (2019). Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Archives of Computational Methods in Engineering, 26: 367–380.
  11. Hatamlou, A. (2018). Solving travelling salesman problem using black hole algorithm. Soft Computing, 22(24): 8167-8175.
  12. Hoffman, K.L., Padberg, M., Rinaldi, G. (2013). Traveling salesman problem. Encyclopedia of operations research and management science. Kluwer Academic Publishers, Spr