Advertisement

U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives: Proof-of-Principle Results

  • Haitham Seada
  • Kalyanmoy Deb
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9019)

Abstract

Evolutionary algorithms (EAs) have been systematically developed to solve mono-objective, multi-objective and many-objective problems, respectively, over the past few decades. Despite some efforts in unifying different types of mono-objective evolutionary and non-evolutionary algorithms, there does not exist too many studies to unify all three types of optimization problems together. In this study, we propose an unified evolutionary optimization algorithm U-NSGA-III, based on recently-proposed NSGA-III procedure for solving all three classes of problems. The \(\text{ U-NSGA-III }\) algorithm degenerates to an equivalent and efficient population-based optimization procedure for each class, just from the description of the number of specified objectives of a problem. The algorithm works with usual EA parameters and no additional tunable parameters are needed. The performance of \(\text{ U-NSGA-III }\) is compared with a real-coded genetic algorithm for mono-objective problems, with NSGA-II for two-objective problems, and with NSGA-III for three or more objective problems. Results amply demonstrate the merit of our proposed unified approach, encourage its further application, and motivate similar studies for a richer understanding of the development of optimization algorithms.

Keywords

Mono-objective optimization Multi-objective optimization Many-objective optimization NSGA-II NSGA-III Unified algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beyer, H.-G., Schwefel, H.-P.: Evolution strategies: A comprehensive introduction. Natural Computing 1, 3–52 (2003)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bradstreet, L., While, L., Barone, L.: A fast incremental hypervolume algorithm. IEEE Transactions on Evolutionary Computation 12(6), 714–723 (2008)CrossRefGoogle Scholar
  3. 3.
    Britto, A., Pozo, A.: I-MOPSO: A suitable PSO algorithm for many-objective optimization. In: 2012 Brazilian Symposium on Neural Networks, pp. 166–171 (2012)Google Scholar
  4. 4.
    Corne, D.W., Knowles, J.D., Oates, M.: The Pareto envelope-based selectionalgorithm for multiobjective optimization. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917. Springer, Heidelberg (2000) Google Scholar
  5. 5.
    Das, I., Dennis, J.E.: Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM Journal of Optimization 8(3), 631–657 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001) zbMATHGoogle Scholar
  7. 7.
    Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Systems 9(2), 115–148 (1995)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)CrossRefGoogle Scholar
  9. 9.
    Deb, K., Goyal, M.: A robust optimization procedure for mechanical component design based on genetic adaptive search. Transactions of the ASME: Journal of Mechanical Design 120(2), 162–164 (1998)CrossRefGoogle Scholar
  10. 10.
    Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, Part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation 18(4), 577–601 (2014)CrossRefGoogle Scholar
  11. 11.
    Deb, K., Tiwari, S.: Omni-optimizer: A generic evolutionary algorithm for global optimization. European Journal of Operations Research (EJOR) 185(3), 1062–1087 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, Part II: Handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation 18(4), 602–622 (2014)CrossRefGoogle Scholar
  13. 13.
    Seada, H., Deb, K.: U-NSGA-III: A unified evolutionary algorithm for single, multiple, and many-objective optimization. COIN Report Number 2014022, Computational Optimization and Innovation Laboratory (COIN), Electrical and Computer Engineering, Michigan State University, East Lansing, USA (2014)Google Scholar
  14. 14.
    Srinivas, N., Deb, K.: Multi-objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation Journal 2(3), 221–248 (1994)CrossRefGoogle Scholar
  15. 15.
    Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6), 712–731 (2007)CrossRefGoogle Scholar
  16. 16.
    Zitzler, E., Laumanns, M., Thiele., L.: SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K.C., et al (eds.) Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, pp. 95–100. International Center for Numerical Methods in Engineering (CIMNE) (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringMichigan State UniversityEast LansingUSA

Personalised recommendations