A comprehensive investigation into the performance, robustness, scalability and convergence of chaos-enhanced evolutionary algorithms with boundary constraints

摘要

The purpose of this research is to investigate the effects of different chaotic maps on the exploration/exploitation capabilities of evolutionary algorithms (EAs). To do so, some well-known chaotic maps are embedded into a self-organizing version of EAs. This combination is implemented through using chaotic sequences instead of random parameters of optimization algorithm. However, using a chaos system may result in exceeding of the optimization variables beyond their practical boundaries. In order to cope with such a deficiency, the evolutionary method is equipped with a recent spotlighted technique, known as the boundary constraint handling method, which controls the movements of chromosomes within the feasible solution domain. Such a technique aids the heuristic agents towards the feasible solutions, and thus, abates the undesired effects of the chaotic diversification. In this study, 9 different variants of chaotic maps are considered to precisely investigate different aspects of coupling the chaos phenomenon with the baseline EA, i.e. the convergence, scalability, robustness, performance and complexity. The simulation results reveal that some of the maps (chaotic number generators) are more successful than the others, and thus, can be used to enhance the performance of the standard EA.