An adaptive resolution hybrid binary-real coded genetic algorithm

Authors:
Omar Arif Abdul-Rahman;Masaharu Munetomo;Kiyoshi Akama
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Hokkaido, Japan 060-0814;Information Initiative Center, Hokkaido University, Hokkaido, Japan;Information Initiative Center, Hokkaido University, Hokkaido, Japan
Venue:
Artificial Life and Robotics
Year:
2011

Citing 2
Cited 1

Practical genetic algorithms

Practical genetic algorithms
A Simulation Test Approach to the Evaluation of Nonlinear Optimization Algorithms

ACM Transactions on Mathematical Software (TOMS)

An adaptive parameter binary-real coded genetic algorithm for constraint optimization problems: Performance analysis and estimation of optimal control parameters

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 identifies 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.