Two decomposition-based modem metaheuristic algorithms for multi-objective optimization — A comparative study

This paper presents the multi-objective variants of two popular metaheuristics of current interest, namely., the artificial bee colony algorithm., and the teaching-learning-based optimization algorithm. These two approaches are used to solve real-parameter., bound constrained multi-objective optimization problems. The proposed multi-objective variants are based on a decomposition approach., where a multi-objective optimization problem is transformed into a number of scalar optimization sub-problems which are simultaneously optimized. The proposed algorithms are tested on seven unconstrained test problems proposed for the special session and competition on multi-objective optimizers held at the 2009 IEEE Congress on Evolutionary Computation as well as on five classical bi-objective test in-stances. The proposed approaches are compared with two de-composition-based multi-objective evolutionary algorithms which are representative of the state-of-the-art in the area. Our results indicate that the proposed approaches obtain highly competitive results in most of the test instances.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[2]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

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

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

[5]  Reza Akbari,et al.  A multi-objective Artificial Bee Colony for optimizing multi-objective problems , 2010, 2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE).

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

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

[8]  Saúl Zapotecas Martínez,et al.  A multi-objective particle swarm optimizer based on decomposition , 2011, GECCO '11.

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

[10]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[11]  Qingfu Zhang,et al.  The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances , 2009, 2009 IEEE Congress on Evolutionary Computation.

[12]  Qingfu Zhang,et al.  Multiobjective evolutionary algorithms: A survey of the state of the art , 2011, Swarm Evol. Comput..

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

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

[15]  K. Fernow New York , 1896, American Potato Journal.

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

[17]  Taher Niknam,et al.  $\theta$-Multiobjective Teaching–Learning-Based Optimization for Dynamic Economic Emission Dispatch , 2012, IEEE Systems Journal.