A Multi-Objective Evolutionary Algorithm Using Min-Max Strategy And Sphere Coordinate Transformation

Abstract Multi-objective evolutionary algorithms using the weighted sum of the objectives as the fitness functions feature simple execution and effectiveness in multi-objective optimization. However, they cannot fmd the Pareto solutions on the non-convex part of the Pareto frontier, and thus aze difficult to find evenly distributed solutions. Under the circumstances, this paper proposes anew evolutionary algorithm using multiple fitness functions. Although the weights generated via the sphere coordinate transformation and uniform design are used to define the fitness, the fitness is not defined by the weighted sum of the objectives. Instead, it is defined by the maximum value of the weighted normalized objectives using amin-max strategy. In this manner, the proposed algorithm can overcome the drawbacks of the algorithms using the weighted sum of the objectives, and explore the objective space to fmd approximate uniformly distributed solutions on the Pareto front gradually. The numerical simulations show t...

[1]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[2]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[3]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[4]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[5]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[6]  Hisao Ishibuchi,et al.  Effects of Removing Overlapping Solutions on the Performance of the NSGA-II Algorithm , 2005, EMO.

[7]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[8]  Yuping Wang,et al.  U-measure: a quality measure for multiobjective programming , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[9]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[10]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[11]  Alice E. Smith,et al.  Solving the semi-desirable facility location problem using bi-objective particle swarm , 2007, Eur. J. Oper. Res..

[12]  K. Fang,et al.  Number-theoretic methods in statistics , 1993 .

[13]  Yuping Wang,et al.  A Novel Multiobjective Evolutionary Algorithm Based on Min-Max Strategy , 2003, IDEAL.

[14]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[15]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[16]  P. Hajela,et al.  Genetic search strategies in multicriterion optimal design , 1991 .

[17]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[18]  Joshua D. Knowles,et al.  ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems , 2006, IEEE Transactions on Evolutionary Computation.

[19]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[20]  José António Tenreiro Machado,et al.  Multi-objective MaxiMin Sorting Scheme , 2005, EMO.