Academic
Publications
A New Memory Based Variable-Length Encoding Genetic Algorithm for Multiobjective Optimization

A New Memory Based Variable-Length Encoding Genetic Algorithm for Multiobjective Optimization,10.1007/978-3-642-19893-9_23,Eduardo G. Carrano,Lívia A.

A New Memory Based Variable-Length Encoding Genetic Algorithm for Multiobjective Optimization  
BibTex | RIS | RefWorks Download
This paper presents a new memory-based variable-length encoding genetic algorithm for solving multiobjective optimization problems. The proposed method is a binary implementation of the NSGA2 and it uses a Hash Table for storing all the solutions visited during algorithm evolution. This data structure makes possible to avoid the re-visitation of solutions and it provides recovering and storage of data with low computational cost. The algorithm memory is used for building crossover, mutation and local search operators with a parameterless variable-length encoding. These operators control the neighborhood based on the density of points already visited on the region of the new solution to be evaluated. Two classical multiobjective problems are used to compare two variations of the proposed algorithm and two variations of the binary NSGA2. A statistical analysis of the results indicates that the memory-based adaptive neighborhood operators are able to provide significant improvement of the quality of the Pareto-set approximations.
Conference: Evolutionary Multi-Criterion Optimization , pp. 328-342, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.