Intelligent evolutionary algorithms for large parameter optimization problems

This work proposes two intelligent evolutionary algorithms IEA and IMOEA using a novel intelligent gene collector (IGC) to solve single and multiobjective large parameter optimization problems, respectively. IGC is the main phase in an intelligent recombination operator of IEA and IMOEA. Based on orthogonal experimental design, IGC uses a divide-and-conquer approach, which consists of adaptively dividing two individuals of parents into N pairs of gene segments, economically identifying the potentially better one of two gene segments of each pair, and systematically obtaining a potentially good approximation to the best one of all combinations using at most 2N fitness evaluations. IMOEA utilizes a novel generalized Pareto-based scale-independent fitness function for efficiently finding a set of Pareto-optimal solutions to a multiobjective optimization problem. The advantages of IEA and IMOEA are their simplicity, efficiency, and flexibility. It is shown empirically that IEA and IMOEA have high performance in solving benchmark functions comprising many parameters, as compared with some existing EAs.

[1]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[2]  Krishna R. Pattipati,et al.  Design of process parameters using robust design techniques and multiple criteria optimization , 1995, IEEE Trans. Syst. Man Cybern..

[3]  Robert L. Armacost,et al.  Review of techniques for optimizing multiple quality characteristics in product development , 1996 .

[4]  Jiju Antony,et al.  Multi‐response optimization in industrial experiments using Taguchi's quality loss function and principal component analysis , 2000 .

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

[6]  Joshua D. Knowles,et al.  M-PAES: a memetic algorithm for multiobjective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[7]  Shinn-Jang Ho,et al.  Design of accurate classifiers with a compact fuzzy-rule base using an evolutionary scatter partition of feature space , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[8]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[9]  Sophie Rochet,et al.  Epistasis in Genetic Algorithms Revisited , 1997, Inf. Sci..

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

[11]  C. Nachtsheim Orthogonal Fractional Factorial Designs , 1985 .

[12]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[13]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[14]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[15]  Ivo F. Sbalzariniy,et al.  Multiobjective optimization using evolutionary algorithms , 2000 .

[16]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[17]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[18]  Elsayed A. Elsayed,et al.  Optimal levels of process parameters for products with multiple characteristics , 1993 .

[19]  Tapan P. Bagchi,et al.  Taguchi methods explained : practical steps to robust design , 1993 .

[20]  Zbigniew Michalewicz,et al.  Evolutionary algorithms for constrained engineering problems , 1996, Computers & Industrial Engineering.

[21]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[22]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[23]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[25]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[26]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

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

[28]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

[29]  Suat Tanaydin Robust Design and Analysis for Quality Engineering , 1996 .

[30]  Shinn-Ying Ho,et al.  An efficient evolutionary algorithm for accurate polygonal approximation , 2001, Pattern Recognit..

[31]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[33]  Shinn-Ying Ho,et al.  Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm , 2002, Pattern Recognit. Lett..

[34]  Shinn-Ying Ho,et al.  Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm , 2003, Pattern Recognit..

[35]  D. Goldberg,et al.  Domino convergence, drift, and the temporal-salience structure of problems , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

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

[38]  Pinaki Mazumder,et al.  SAGA : a unification of the genetic algorithm with simulated annealing and its application to macro-cell placement , 1994, Proceedings of 7th International Conference on VLSI Design.

[39]  K Krishnakumar,et al.  Solving large parameter optimization problems using genetic algorithms , 1995 .

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

[41]  Sundar Krishnamurty,et al.  A robust multi-criteria optimization approach , 1997 .

[42]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[43]  Genichii Taguchi,et al.  Introduction to quality engineering. designing quality into products a , 1986 .