Multi-objective evolutionary programming without non-domination sorting is up to twenty times faster

In this paper, Multi-objective evolutionary programming (MOEP) using fuzzy rank-sum with diversified selection is introduced. The performances of this algorithm as well as MOEP with non-domination sorting on the set of benchmark functions provided for CEC2009 Special Session and competition on Multi-objective Optimization are reported. With this rank-sum sorting and diversified selection, the speed of the algorithm has increased significantly, in particular by about twenty times on five objective problems when compared with the implementation using the non-domination sorting. Beside this, the proposed approach has performed either comparable or better than the MOEP with non-domination sorting.

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

[2]  Xin Yao,et al.  Fast Evolutionary Programming , 1996, Evolutionary Programming.

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

[4]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[5]  Ponnuthurai N. Suganthan,et al.  Evaluation of novel adaptive evolutionary programming on four constraint handling techniques , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Tomoyuki Hiroyasu,et al.  SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 , 2004, PPSN.

[7]  Jian Liu,et al.  A Hybrid Genetic and Particle Swarm Algorithm for Service Composition , 2007, Sixth International Conference on Advanced Language Processing and Web Information Technology (ALPIT 2007).

[8]  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).

[9]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

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

[11]  Soon-Thiam Khu,et al.  An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization , 2007, IEEE Transactions on Evolutionary Computation.

[12]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[13]  K.Y. Lee,et al.  Multi-Objective Evolutionary Programming for Economic Emission Dispatch problem , 2008, 2008 IEEE Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century.

[14]  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.

[15]  Gary G. Yen,et al.  Dynamic Population Size in PSO-based Multiobjective Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[17]  Qingfu Zhang,et al.  Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition , 2009 .

[18]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..