Advertisement

Fast Multiobjective Hybrid Evolutionary Algorithm Based on Mixed Sampling Strategy

  • Wenqiang ZhangEmail author
  • Yu Wang
  • Chunxiao Wang
  • Le Xiao
  • Mitsuo Gen
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)

Abstract

In this paper, a fast multiobjective hybrid evolutionary algorithm (MOHEA) is proposed to solve the multiobjective optimization problem (MOOP) in achieving a balance between convergence and distribution with computational complexity. The proposed algorithm, MOHEA, improves the vector evaluated genetic algorithm (VEGA) by combing a new sampling strategy according to the Pareto dominating and dominated relationship-based fitness function. VEGA is good at searching the edge region of the Pareto front, but it has neglected the central area of the Pareto front, and the new sampling strategy prefers the center region of the Pareto front. The mixed sampling strategy improves the convergence performance and the distribution performance while reducing the computational time. Simulation experiments on multiobjective test problems show that, compared with NSGA-II and SPEA2, the fast multiobjective hybrid evolutionary algorithm is better in the two aspects of convergence and distribution, and has obvious advantages in the efficiency.

Keywords

Evolutionary algorithm Mixed sampling Multi-objective optimization Styling Benchmark 

Notes

Acknowledgements

This research work is supported by the National Natural Science Foundation of China (U1304609), Foundation for Science & Technology Research Project of Henan Province (162102210044, 152102210068, 152102110076), Program for Innovative Research Team (in Science and Technology) in University of Henan Province (17IRTSTHN011), Program for Key Project of Science and Technology in University of Education Department of Henan Province (17A520030), Fundamental Research Funds for the Henan Provincial Colleges and Universities (2014YWQQ12, 2015XTCX03, 2015XTCX04), Research Funds for Key Laboratory of Grain Information Processing and Control (Henan University of Technology) (KFJJ-2015-106), Ministry of Education and the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS): No. 15K00357.

References

  1. 1.
    Deb K, Beyer HG (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197–221CrossRefGoogle Scholar
  2. 2.
    Deb K, Goyal M (1999) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30–45Google Scholar
  3. 3.
    Deb K, Pratap A et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  4. 4.
    Gaspar-Cunha A, Covas JA (2001) Robustness in multi-objective optimization using evolutionary algorithms. John Wiley & Sons, IncGoogle Scholar
  5. 5.
    Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302CrossRefGoogle Scholar
  6. 6.
    Non-Member WZ, Member SFS (2012) Multiobjective process planning and scheduling using improved vector evaluated genetic algorithm with archive. IEEJ Trans Electr Electron Eng 7(3):258–267CrossRefGoogle Scholar
  7. 7.
    Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: International Conference on Genetic Algorithms, pp 93–100Google Scholar
  8. 8.
    Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Cell Immunol 37(1):1–13MathSciNetGoogle Scholar
  9. 9.
    Tukey JW (1978) Variations of box plots. Am Stat 32(1):12–16Google Scholar
  10. 10.
    Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRefGoogle Scholar
  11. 11.
    Yu X, Gen M (2010) Introduction to Evolutionary Algorithms. Springer, LondonCrossRefzbMATHGoogle Scholar
  12. 12.
    Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257–271CrossRefGoogle Scholar
  13. 13.
    Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. vol 3242, pp 95–100Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Wenqiang Zhang
    • 1
    • 2
    Email author
  • Yu Wang
    • 1
    • 2
  • Chunxiao Wang
    • 1
    • 2
  • Le Xiao
    • 1
    • 2
  • Mitsuo Gen
    • 3
  1. 1.Henan University of TechnologyZhengzhouChina
  2. 2.Key Laboratory of Grain Information Processing and ControlMinistry of EducationZhengzhouPeople’s Republic of China
  3. 3.Fuzzy Logic Systems InstituteTokyo University of ScienceTokyoJapan

Personalised recommendations