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.
|Subjects||Operations Research and Management Science|
|Publication Date||June 30, 2020|
|Application Date||June 12, 2019|
|Acceptance Date||June 5, 2020|
|Published in Issue||Year 2020, Volume 8, Issue 1|
Alphanumeric Journal is hosted on DergiPark, a web based online submission and peer review system powered by TUBİTAK ULAKBIM.