Improving multiobjective evolutionary algorithm by adaptive fitness and space division

Abstract

In this paper, a novel evolutionary algorithm based on adaptive multiple fitness functions and adaptive objective space division for multiobjective optimization is proposed. It can overcome the shortcoming of those using the weighted sum of objectives as the fitness functions, and find uniformly distributed solutions over the entire Pareto front for non-convex and complex multiobjective programming. First, we divide the objective space into multiple regions with about the same size by uniform design adaptively, then adaptively define multiple fitness functions to search these regions, respectively. As a result, the Pareto solutions found on each region are adaptively changed and eventually are uniformly distributed over the entire Pareto front. We execute the proposed algorithm to solve five standard test functions and compare performance with that of four widely used algorithms. The results show that the proposed algorithm can generate widely spread and uniformly distributed solutions over the entire Pareto front, and perform better than the compared algorithms. © Springer-Verlag Berlin Heidelberg 2005.