Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems

Mehmet Hakan Satman and Emre Akadal

Alphanumeric Journal, 2020, vol. 8, issue 1, 43-58

Abstract: 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.

Keywords: Evolutionary Optimization; Genetic Algorithm; Optimization; Simulation (search for similar items in EconPapers)
JEL-codes: C63 C80 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.alphanumericjournal.com/media/Issue/vo ... rameter-_rOBmpZw.pdf (application/pdf)
https://alphanumericjournal.com/article/machine-co ... timization-problems/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:anm:alpnmr:v:8:y:2020:i:1:p:43-58

DOI: 10.17093/alphanumeric.576919

Access Statistics for this article

More articles in Alphanumeric Journal from Bahadir Fatih Yildirim
Bibliographic data for series maintained by Bahadir Fatih Yildirim ().