SavedAdd your journal

Journals / Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik / 2001 / Cilt: 2 - Sayı: 1

Genetik algoritmalara genel bir bakış

An overview of genetic algorithms

Özgür YENİAY
Pages
37–49
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)

Finally, a literature survey for the applications of GAs to Operational Research (OR) problems is also provided.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this paper, general knowledge about Genetic Algorithms (GAs), which have received much attention the past few years because of the fact that they have been successfully applied in several different fields of study, is given.
📊
Key Findings & Data:The basic principles of GAs, such as representation, selection and genetic operators are summarized and the fundamental theorem of GAs, the so-called schema theorem, is discussed.
💡
Conclusion & Impact:Finally, a literature survey for the applications of GAs to Operational Research (OR) problems is also provided.
🔬Design:Survey & Empirical Study
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this paper, general knowledge about Genetic Algorithms (GAs), which have received much attention the past few years because of the fact that they have been successfully applied in several different fields of study, is given. The basic principles of GAs, such as representation, selection and genetic operators are summarized and the fundamental theorem of GAs, the so-called schema theorem, is discussed. A simple example is given in order to explain how they work. Finally, a literature survey for the applications of GAs to Operational Research (OR) problems is also provided.

Özet

Bu çalışmada, birçok farklı alanda başarıyla uygulanmalarından dolayı son yıllarda büyük ilgi gören Genetik Algoritmalar (GA) hakkında genel bilgi verilmektedir. GA'ların gösterim, seçme ve genetik operatörler gibi temelleri özetlenmekte ve şema teoremi olarak bilinen GA'ların temel teoremi incelenmektedir. GA'ların nasıl işlediğini açıklamak amacıyla basit bir örnek verilmektedir. Son olarak, Yöneylem Araştırması problemlerinde GA'ların uy-gulamalarına yönelik bir yayın taraması da sunulmaktadır.

🔖

Cite This Article

YENİAY, Ö. (2022). Genetik algoritmalara genel bir bakış. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik, Cilt: 2 - Sayı: 1, 37–49. https://ajindex.com/articles/438526

📄 Full Text PDF Viewer

📄

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

References (15)

  1. Ahuja, R.K., Orlin, J.B. and Tiwari, A. (1994). Assembly Line Balancing Using Genetic Algorithms with Heuristic Generated Initial Populations and Multiple Evaluation Criteria, Decision Sciences, 25,581-606.
  2. Al-Hakim, L. (2000). On Solving Facility Layout Problems Using Genetic Algorithms, International Journal of Production Research, 38, 2573-2582.
  3. Al-Sultan, K.S., Hussain, M.F. and Nizami, J.S. (1996). A Genetic Algorithm for the Set Covering Problem, Journal of the Operational Research Society, 47,702-709.
  4. Altıparmak, F., Dengiz, B. and Smith, A.E. (2000). An Evolutionary Approach for Reliability Optimization in Fixed Topology Computer Networks, Yöneylem Araştırması Dergisi, 12, 57-75.
  5. Armentano, V. A. and Mazzini, R. (2000). A Genetic Algorithm for Scheduling on a Single Machine with Set-up Times and Due Dates, Production Planning & Control, 11,713-720.
  6. Awadh, B., Sepehri, N. and Hawaleshka, O. (1995). A Computer-Aided Process Planning Model Based on Genetic Algorithms, Computers & Operations Jiesearch, 22, 841-856.
  7. Badami, V.S. and Parks, C.M. (1991). A Classifier Based Approach to Flow Shop Scheduling, Computers & Industrial Engineering, 21, 329-333.
  8. Beasley, D., Bull, D.R. and Martin, R.R. (1993). An Overview of Genetic Algorithms: Part I-Funda-mentals, Univ. Compt., 15, 258-269.
  9. Beasly, J.E. and Chu, P.C. (1996). A Genetic Algorithm for The Set Covering Problem, European Journal of Operational Research, 94, 392-404.
  10. Biegel, J.E. and Davern, J.J. (1990). Genetic Algorithms and Job Shop Scheduling, Computers & Industrial Engineering, 19, 81-91.
  11. Bierwirth, C. (1995). A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms, OR Spektrum, 17,87-92.
  12. Blickle, T. and Thiele, L. (1995). A Comparison of Selection Schemes Used in Genetic Algorithms, T1K-Report, No: 11, 2nd edition. Cai, X. and Li, K.N. (2000). A Genetic Algorithm for Scheduling Staff of Mixed Skills Under Multi-Criteria, European Journal of Operational Research, 125, 359-369.
  13. Candido, M.A.B., Khator, S.K. and Barcia, R.M. (1998). A Genetic Algorithm Based Procedure for More Realistic Job Shop Scheduling Problems, International Journal of Production Research, 36, 3437-3457.
  14. Cavalieri. S. and Gaiardelli, P. (1998). Hybrid Genetic Algorithms for a Multiple-Objective Scheduling Problem, Journal of Intelligent Manufacturing, 9, 361-367.
  15. Chan, K.C. and Tansri, H. (1994). A Study of Genetic Crossover Operations on The Facilities Layout Problem, Computers & Industrial Engineer