Journals / Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi / 2012 / Cilt: 13 - Sayı: 2

Current Social-Based Heuristic Optimization Algorithms

Pages
39–56
Publication Date
2022-10-11
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)

In this study, how the imperialist competitive algorithms and parliamentary optimization algorithms which are social-based algorithms are modeled and how parliamentary optimization algorithm is implemented on the problems have been mentioned.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Optimization is the process of making something better.
📊
Key Findings & Data:For example, in an f(x) function in optimization, it is asked for finding x values which make the values of the result minimum.
💡
Conclusion & Impact:In this study, how the imperialist competitive algorithms and parliamentary optimization algorithms which are social-based algorithms are modeled and how parliamentary optimization algorithm is implemented on the problems have been mentioned.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Optimization is the process of making something better. For example, in an f(x) function in optimization, it is asked for finding x values which make the values of the result minimum. Different methods have been proposed for solving optimization problems. Some of these processes have been inspired by natural processes. Ant colony optimization algorithm can be given as an example. Some of the other methods have been inspired by social events. Although the number of social based methods is limited, the most known one is tabu search algorithm. Recently, researchers have developed teaching-learning based algorithm, imperialist competitive algorithm, and parliamentary optimization algorithm. In this study, how the imperialist competitive algorithms and parliamentary optimization algorithms which are social-based algorithms are modeled and how parliamentary optimization algorithm is implemented on the problems have been mentioned.

🔖

Cite This Article

ALATAŞ, B., KIZILOLUK, S. (2022). Current Social-Based Heuristic Optimization Algorithms. Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi, Cilt: 13 - Sayı: 2, 39–56. https://ajindex.com/articles/480825

📄 Full Text PDF Viewer

📄

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

References (11)

  1. ABDECHİRİ, M.; K. FAEZ ve H. BAHRAMİ (2010), "Adaptive Imperialist Competitive Algorithm", 9th IEEE International Conference on Cognitive Informatics (ICCI), pp. 940-945.
  2. ABDECHİRİ, M.; K. FAEZ ve H. BAHRAMİ (2010), "Neural Network Learning Based on Chaotic Imperialist Competitive Algorithm", 2nd International Workshop on Intelligent Systems and Applications (ISA), pp.1-5.
  3. ALATAİ, B. (2007), "Kaotik haritalı parçacık sürü optimizasyonu algoritmaları geliştirme", Doktora Tezi, Fırat Üniversitesi Fen Bilimleri Enstitüsü. ATASHPAZ-GARGARİ, E. ve C. LUCAS (2007), "Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition", IEEE Congress on Evolutionary Computation, pp. 4661-4667.
  4. BORJİ, A. (2007), "A New Global Optimization Algorithm Inspired by Parliamentart Political Competitions", Lecture Notes in Computer Science, 4827/2007, pp. 61-71.
  5. BORJİ, A. ve M. Hamidi (2009), "A New Approach to Global Optimization Motivated by Parliamentary Political Competitions", Int. Journal of Innovative Computing Information and Control, vol. 5, no. 6, pp. 1643-1653.
  6. GHALEHPARDAZ, S.L. ve M. Shafiee (2011), "Speed Control of DC Motor Using Imperialist Competitive Algorithm Based on PI-Like FLC", Third International Conference on Computational Intelligence, Modelling and Simulation, pp. 28-33.
  7. KHADEMOLGHORANİ, F. (2011), "An effective algorithm for mining association rules based on imperialist competitive algorithm", Sixth International Conference on Digital Information Management pp. 6-11.
  8. MOVAHED, M.A. ve A.M. Yazdani (2011), "Application of Imperialist Competitive Algorithm in Online PI Controller", Second International Conference on Intelligent Systems, Modelling and Simulation, pp. 83-87. RAO R.V.; V.J. Savsani ve D.P. Vakharia (2012), "Teaching–LearningBased Optimization: An optimization method for continuous non-linear large scale problems” Information Sciences, vol. 183, no. 1, pp. 1-15,
  9. RAZZAGHPOUR, M ve Rusu, Ana (2011), "Analog circuit optimization via a modified Imperialist Competitive Algorithm", IEEE International Symposium on Circuits and Systems, pp. 2273-2276.
  10. SAYADNAVARD, M.H.; A.T. Haghighat ve M. Abdechiri (2010), "Wireless sensor network localization using Imperialist Competitive Algorithm", 3rd IEEE International Conference on Computer Science and Information Technology, vol. 9, pp.818-822.
  11. TAMİMİ, A.; H. Sadjadian ve H. Omranpour (2010)," Mobile Robot Global Localization using Imperialist Competitive Algorithm",