open access

https://hdl.handle.net/2115/46831

An adaptive resolution hybrid binary-real coded genetic algorithm

英語

Hybrid scheme

2011

Springer

Artificial Life and Robotics

16(1)

121-124

In genetic algorithms (GAs), is it better to use binary encoding schemes or floating point encoding schemes? In this article, we try to tackle this controversial question by proposing a novel algorithm that divides the computational power between two cooperative versions of GAs. These are a binary-coded GA (bGA) and a real-coded GA (rGA). The evolutionary search is primarily led by the bGA, which identifi es promising regions in the search space, while the rGA increases the quality of the solutions obtained by conducting an exhaustive search throughout these regions. The resolution factor (R), which has a value that is increasingly adapted during the search, controls the interactions between the two versions. We conducted comparison experiments employing a typical benchmark function to prove the feasibility of the algorithm under the critical scenarios of increasing problem dimensions and decreasing precision power.

学術雑誌論文

Accepted Manuscript

The original publication is available at www.springerlink.com

1433-5298