SavedAdd your journal

Journals / Alphanumeric Journal / 2020 / Cilt: 8 - Sayı: 1

Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems

Mehmet Hakan SATMAN
Emre AKADAL
Pages
43–58
Publication Date
2020-06-30
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)

Simulation results show that the improvement in search capabilities is significant for many test functions in many dimensions and different levels of difficulty.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Öz In this paper, we extend the Compact Genetic Algorithm (CGA) for real-valued optimization problems by dividing the total search process into three stages.
📊
Key Findings & Data:In the first stage, an initial vector of probabilities is generated.
💡
Conclusion & Impact:Simulation results show that the improvement in search capabilities is significant for many test functions in many dimensions and different levels of difficulty.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Anahtar Kelimeler Optimization · genetic algorithms · evolutionary optimization

Özet

Öz In this paper, we extend the Compact Genetic Algorithm (CGA) for real-valued optimization problems by dividing the total search process into three stages. In the first stage, an initial vector of probabilities is generated. The initial vector contains the probabilities of bits having 1 depending on the bit locations as defined in the IEEE-754 standard. In the second stage, a CGA search is applied on the objective function using the same encoding scheme. In the last stage, a local search is applied using the result obtained by the previous stage as the starting point. A simulation study is performed on a set of well-known test functions to measure the performance differences. Simulation results show that the improvement in search capabilities is significant for many test functions in many dimensions and different levels of difficulty.

🔖

Cite This Article

SATMAN, M. H., AKADAL, E. (2020). Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems. Alphanumeric Journal, Cilt: 8 - Sayı: 1, 43–58. https://ajindex.com/articles/63482

📄 Full Text PDF Viewer

📄

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

References (12)

  1. Aporntewan C. and Chongstitvatana P. (2001) A hardware implementation of the compact genetic algorithm. In Evolutionary Computation, 2001. Proceedings of the 2001 Congress on, volume 1, pages 624–629. IEEE, 2001.
  2. Arakaki, R. K and Usberti, F. L. (2018) Hybrid genetic algorithm for the open capacitated arc routing problem. Computers & Operations Research, 90:221–231.
  3. Budin, L., Golub, M., & Budin, A. (2010). Traditional techniques of genetic algorithms applied to floating-point chromosome representations. Sign, 1(11), 52. Chen, J., Xin, B., Peng, Z. Dou, L. and Zhang, J. (2009) Optimal contraction theorem for exploration–exploitation tradeoff in search and optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 39(3), 680–691.
  4. Goldberg, D. E. (1991) Real-coded genetic algorithms, virtual alphabets, and blocking. Complex systems, 5(2). 139–167.
  5. Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Goldberg. D. E (1989).
  6. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1st edition. Gonçalves, J. F. And Mendes, J. J. M and Resende, M. GC. (2005) A hybrid genetic algorithm for the job shop scheduling problem. European journal of operational research, 167(1), 77–95.
  7. Harik, G. R., Lobo, F. G. and Goldberg, D. E. (1999) The compact genetic algorithm. IEEE transactions on evolutionary computation, 3(4). 287–297.
  8. Holland, J. H. (1992). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press. Hooke, R. and Jeeves, T. A. (1961) “direct search” solution of numerical and statistical problems. Journal of the ACM (JACM), 8(2), 212–229. Ieee standard for floating-point arithmetic. IEEE Std 754-2008, pages 1–70, Aug 2008.
  9. Kang, F., Li, J., Ma, Z., & Li, H. (2011). Artificial bee colony algorithm with local search for numerical optimization. Journal of Software, 6(3), 490-497.
  10. Kim, D. H., Abraham, A. and Cho, J. H. (2007) A hybrid genetic algorithm and bacterial foraging approach for global optimization. Information Sciences, 177(18), 3918–3937.
  11. Liu, D., Liu, C., Zhang, C., Xu, C., Du, Z. and Wan, Z. (2018), "Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems: A comparative study", Engineering Computations, 35(2), 979-1002.
  12. Long, Q., & Wu, C. (2014). A hybrid method combining genetic algorithm and Hooke-Jeeve