SavedAdd your journal

Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2022 / Cilt: 37 - Sayı: 4

A new selection strategy for multi objective genetic algorithm: MultiMoora Rank Selection

Çok amaçlı genetik algoritma için yeni bir seçim stratejisi önerisi: MultiMoora Rank seçimi

Alparslan DEMİR
Mine Büşra GELEN
Pages
2119–2132
Publication Date
2022-02-28
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 proposed MultiMoora Rank Selection method outperformed the compared methods.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Genetic algorithms are metaheuristic methods that provide satisfactory solutions for complex problems within acceptable time periods.
📊
Key Findings & Data:In genetic algorithms, the selection strategy considerably affects the quality of the solution.
💡
Conclusion & Impact:The results showed that the proposed MultiMoora Rank Selection method outperformed the compared methods.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Çok amaçlı optimizasyon · akış tipi çizelgeleme · genetik algoritma

Abstract

Genetic algorithms are metaheuristic methods that provide satisfactory solutions for complex problems within acceptable time periods. In genetic algorithms, the selection strategy considerably affects the quality of the solution. In the study, the MultiMoora Rank Selection (MMRS) strategy based on the MultiMoora method, a multi-criteria decision-making method, was developed to improve the performance of the Multi Objective Genetic Algorithms (MOGA). The performance of the method was tested using flow-shop scheduling problems. The results obtained with the MultiMoora Rank Selection were evaluated by comparing with the results obtained using the same problem with the selection methods that are widely used for genetic algorithms, such as the Roulette Wheel Selection, Linear Rank Selection and Tournament Selection methods. The results showed that the proposed MultiMoora Rank Selection method outperformed the compared methods.

Özet

Genetik algoritmalar çözümü zor problemler için kabul edilebilir süre ve kalitede çözüm bulan metasezgisel bir tekniktir. Genetik algoritma uygulamalarında tercih edilen seçim stratejileri, çözüm kalitesini önemli ölçüde etkilemektedir. Bu çalışmada, Çok Amaçlı Genetik Algoritmalar (ÇAGA)’ın performansını arttırmak amacıyla, çok kriterli karar verme yöntemlerinden biri olan MultiMoora metoduna dayalı MultiMoora Rank Seçimi (MMRS) seçim stratejisi geliştirilmiştir. Geliştirilen metodun performansı çok amaçlı akış tipi çizelgeleme problemlerinde test edilmiştir. MultiMoora Rank Seçimi ile elde edilen sonuçlar, genetik algoritmada yaygın olarak kullanılan Rulet Tekerleği Seçimi, Lineer Rank Seçimi ve Turnuva Seçimi metotlarının aynı problem üzerindeki sonuçları ile karşılaştırılarak değerlendirilmiştir. Elde edilen sonuçlar, önerilen MultiMoora Rank Seçimi metodunun karşılaştırılan diğer metotlara üstünlük sağladığını göstermektedir.

🔖

Cite This Article

DEMİR, A., GELEN, M. B. (2022). A new selection strategy for multi objective genetic algorithm: MultiMoora Rank Selection. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 37 - Sayı: 4, 2119–2132. https://ajindex.com/articles/393797

📄 Full Text PDF Viewer

📄

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

References (13)

  1. Çalışkan F., Yüksel H., Dayık M., Genetik Algoritmaların Tasarım Sürecinde Kullanılması, SDU Teknik Bilimler Dergisi, 6(2), 2016.
  2. Goldberg D. E., Deb K., A comparative analysis of selection schemes used in genetic algorithms, Foundations of genetic algorithms, 1, 69-93, 1991.
  3. Chakraborty U. K., Deb K., Chakraborty M., Analysis of selection algorithms: A Markov chain approach, Evolutionary Computation, 4(2), 133-167, 1996.
  4. Chakraborty M., Chakraborty U. K., An analysis of linear ranking and binary tournament selection in genetic algorithms, Information. Communications and Signal Processing. ICICS, Proceedings of 1997 International Conference, 1, 407-411, 1997.
  5. Alfonso H., Cesan P., Fernandez N., Minetti G. F., Salto C., Velazco L., Gallard R. H., Contrasting main selection methods in genetic algorithms, IV Congreso Argentina de Ciencias de la Computación, 1998.
  6. Wiese K., Goodwin S. D., Keep-best reproduction: a selection strategy for genetic algorithms, Proceedings of the 1998 ACM symposium on Applied Computing, 343-348, 1998.
  7. Wiese K., Goodwin S. D., The effect of genetic operator probabilities and selection strategies on the performance of a genetic algorithm, Conference of the Canadian Society for Computational Studies of Intelligence, Springer, 139-153, 1998.
  8. Andrade A. V., Errico L. D., Aquino A. L. L. D., Assis L. P. D., Barbosa C. H. N. D. R., Analysis of selection and crossover methods used by genetic algorithm-based heuristic to solve the lsp allocation problem in mpls networks under capacity constraints, International Conference on Engineering Optimization, 2008.
  9. Xie H., Zhang M., Tuning Selection Pressure in Tournament Selection, School of Engineering and Computer Science, Victoria University of Wellington, 2009.
  10. Chudasama C., Shah S. M., Panchal M., Comparison of parents selection methods of genetic algorithm for TSP, International Conference on Computer Communication and Networks CSI-COMNET-2011, Proceedings, 85-87, 2011.
  11. Razali N. M., Geraghty J., Genetic algorithm performance with different selection strategies in solving TSP, Proceedings of the world congress on engineering, 2, 1134-1139, 2011.
  12. Kumar R., Blending roulette wheel selection & rank selection in genetic algorithms, International Journal of Machine Learning and Computing, 2(4), 365, 2012.
  13. Alabsi F., Naoum R., Comparison of selection methods and crossover operations using steady state genetic based intrusion detection system, Journal of Emerging Trends in Computing and Information