SavedAdd your journal

Journals / Politeknik Dergisi / 2020 / Cilt: 23 - Sayı: 2

Analysis, Test and Management of the Meta-Heuristic Searching Process: An Experimental Study on SOS

Hamdi Tolga KAHRAMAN
Sefa ARAS
Yusuf SÖNMEZ
Uğur GÜVENÇ
Eyüp GEDİKLİ
Pages
445–455
Publication Date
2020-06-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)

Additionally, it is expected that the new experimental test methods developed and presented in this paper contributes to meta-heuristic algorithms studies for designing and testing.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In a search process, getting trapped in a local minimum or jumping the global minimum problems are also one of the biggest problems of meta-heuristic algorithms as in artificial intelligence methods.
📊
Key Findings & Data:Important information that enhances the performance of operators in the search process has been achieved through experimental studies.
💡
Conclusion & Impact:Additionally, it is expected that the new experimental test methods developed and presented in this paper contributes to meta-heuristic algorithms studies for designing and testing.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Symbiotic organisms search · benchmark problem · algorithm analyze

Abstract

In a search process, getting trapped in a local minimum or jumping the global minimum problems are also one of the biggest problems of meta-heuristic algorithms as in artificial intelligence methods. In this paper, causes of these problems are investigated and novel solution methods are developed. For this purpose, a novel framework has been developed to test and analyze the meta-heuristic algorithms. Additionally, analysis and test studies have been carried out for Symbiotic Organisms Search (SOS) Algorithm. The aim of the study is to measure the mimicking a natural ecosystem success of symbiotic operators. Thus, problems in the search process have been discovered and operators' design mistakes have been revealed as a case study of the developed testing and analyzing method. Moreover, ways of realizing a precise neighborhood search (intensification) and getting rid of the local minimum (increasing diversification) have been explored. Important information that enhances the performance of operators in the search process has been achieved through experimental studies. Additionally, it is expected that the new experimental test methods developed and presented in this paper contributes to meta-heuristic algorithms studies for designing and testing.

Özet

In a search process, getting trapped in a local minimum or jumping the global minimum problems are also one of the biggest problems of meta-heuristic algorithms as in artificial intelligence methods. In this paper, causes of these problems are investigated and novel solution methods are developed. For this purpose, a novel framework has been developed to test and analyze the meta-heuristic algorithms. Additionally, analysis and test studies have been carried out for Symbiotic Organisms Search (SOS) Algorithm. The aim of the study is to measure the mimicking a natural ecosystem success of symbiotic operators. Thus, problems in the search process have been discovered and operators' design mistakes have been revealed as a case study of the developed testing and analyzing method. Moreover, ways of realizing a precise neighborhood search (intensification) and getting rid of the local minimum (increasing diversification) have been explored. Important information that enhances the performance of operators in the search process has been achieved through experimental studies. Additionally, it is expected that the new experimental test methods developed and presented in this paper contributes to meta-heuristic algorithms studies for designing and testing.

🔖

Cite This Article

KAHRAMAN, H. T., ARAS, S., SÖNMEZ, Y., GÜVENÇ, U., GEDİKLİ, E. (2020). Analysis, Test and Management of the Meta-Heuristic Searching Process: An Experimental Study on SOS. Politeknik Dergisi, Cilt: 23 - Sayı: 2, 445–455. https://ajindex.com/articles/422211

📄 Full Text PDF Viewer

📄

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

References (1)

  1. Blum C. and Roli A., “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”, ACM Computing Surveys, 35(3), 268-308, (2003).[2] Yang X.S., Scholarpedia, 6(8):1147, (2011).[3] Holland J.H., “Adaption in Natural and Artificial Systems”, University of Michigan Pres, Ann Arbor, MI, USA, (1975).[4] Goldberg D. E., “Genetic Algorithms in Search, Optimization, and Machine Learning”, Reading, MA: Addison-Wesley, ISBN 0201157675, (1989).[5] Dorigo M., “Optimization, Learning and Natural Algorithms”, PhD thesis, Politecnico di Milano, (1992).[6] Dorigo M., Maniezzo V., and Colorni A., “Ant System: Optimization by a colony of cooperating agents”, IEEE Trans Syst Man Cybernet Part B, 26(1):29–41, (1996).[7] Dorigo M. and Stützle T., “Ant Colony optimization”, MA: MIT Press, Cambridge, (2004).[8] Eberhart R. C. and Kennedy J., “A new optimizer using particle swarm theory”, Proceedings of the sixth international symposium on micro machine and human science, Piscataway, NJ, Nagoya, Japan, 39-43, (1995).[9] Eberhart R. C. and Shi Y., “Particle swarm optimization: developments, applications and resources”, Proc. congress on evolutionary computation, Piscataway, NJ., Seoul, Korea., 81-86, (2001).[10] Rajabioun R., “Cuckoo Optimization Algorithm”, Applied Soft Computing, 11:5508-5518, (2011).[11] Karaboga D., and Basturk B., “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm” Journal of Global Optimization, 39:459–471, (2007).[12] Karaboga D., and Ozturk C., “A novel clustering approach: Artificial Bee Colony (ABC) algorithm”, Applied Soft Computing, 11(1): 652-657, (2011).[13] Rashedi E., Nezamabadi-pour H., and Saryazdi S., “GSA: A Gravitational Search Algorithm”, Information Sciences, 179: 2232–2248, (2009).[14] Kahraman H. T., Sagiroglu S., and Colak I., “The development of intuitive knowledge classifier and the modeling of domain dependent data”, Knowledge Based Systems, 37: 283-295, (2013).[15] Rao R.V., Savsani V.J, and Vakharia D.P., “Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems”, Computer-Aided Design, 43: 303–315, (2011).[16] Cheng M.Y., and Prayogo D., “Symbiotic Organisms Search: A new metaheuristic optimization algorithm”, Computers and Structures, 139: 98–112, (2014).[17] Trana D.H., Cheng M.Y., and Prayogo D., “A novel Multiple Objective Symbiotic Organisms Search (MOSOS) for time–cost–labor utilization trad