A New Genetic Algorithm with Elliptical Crossover for Constrained Multi-objective Optimization Problems

The crossover operator plays an important role in a genetic algorithm, which produces two or more offspring for each pair of parents. With the help of the crossover operator, the genetic algorithm can explore the search space effectively. In this paper, we propose a new crossover operator called elliptical crossover operator, which can explore the search domain effectively. A local search scheme is designed to get more precise and wider nondominated solutions. In the local search scheme, the square search scheme and uniform design methods are combined. Based on the elliptical crossover operator and the local search scheme, a novel genetic algorithm is designed for constrained multi-objective optimization problems. Simulation results on several test functions indicates the effectiveness of the designed algorithm.

[1]  Robert C. Kohberger,et al.  Cluster Analysis (3rd ed.) , 1994 .

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

[3]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[4]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[5]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[6]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[7]  Lothar Thiele,et al.  An evolutionary algorithm for multiobjective optimization: the strength Pareto approach , 1998 .

[8]  G. De Soete,et al.  Clustering and Classification , 2019, Data-Driven Science and Engineering.

[9]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[10]  Yuping Wang,et al.  A Novel Multi-Objective Evolutionary Algorithm Based on External Dominated Clustering , 2008, 2008 International Conference on Computational Intelligence and Security.

[11]  T. T. Binh.  MOBES : A multiobjective evolution strategy for constrained optimization problems , 1997 .

[12]  Yuping Wang,et al.  Preference Bi-objective Evolutionary Algorithm for Constrained Optimization , 2005, CIS.

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

[14]  Joshua D. Knowles,et al.  An Evolutionary Approach to Multiobjective Clustering , 2007, IEEE Transactions on Evolutionary Computation.

[15]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[16]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[17]  B. S. Everitt,et al.  Cluster analysis , 2014, Encyclopedia of Social Network Analysis and Mining.

[18]  David G. Stork,et al.  Pattern Classification , 1973 .

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

[20]  Arnold J. Stromberg,et al.  Number-theoretic Methods in Statistics , 1996 .

[21]  Jeffrey Horn,et al.  The Niched Pareto Genetic Algorithm 2 Applied to the Design of Groundwater Remediation Systems , 2001, EMO.

[22]  Masahiro Tanaka,et al.  GA-based decision support system for multicriteria optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[23]  M. A. Abido,et al.  Optimal VAR dispatch using a multiobjective evolutionary algorithm , 2005 .

[24]  K. C. Seow,et al.  MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM , 2001 .