Adaptive representation for single objective optimization

Crina Groşan

doi:10.1007/s00500-004-0402-7

2004-08-20

PRE

Crina Groşan *

Mihai Oltean

DOI：10.1007/s00500-004-0402-7

原文链接

原文求助

摘要

En 中文

A new technique called Adaptive Representation Evolutionary Algorithm (AREA) is proposed in this paper. AREA involves dynamic alphabets for encoding solutions. The proposed adaptive representation is more compact than binary representation. Genetic operators are usually more aggressive when higher alphabets are used. Therefore the proposed encoding ensures an efficient exploration of the search space. This technique may be used for single and multiobjective optimization. We treat the case of single objective optimization problems in this paper. Despite its simplicity the AREA method is able to generate a population converging towards optimal solutions. Numerical experiments indicate that the AREA technique performs better than other single objective evolutionary algorithms on the considered test functions.

Keyword:

evolution strategy

single objective optimization

adaptive representation

higher alphabets encoding