Skip to main content

Fast Multiobjective Hybrid Evolutionary Algorithm Based on Mixed Sampling Strategy

  • Conference paper
  • First Online:
Proceedings of the Eleventh International Conference on Management Science and Engineering Management (ICMSEM 2017)

Part of the book series: Lecture Notes on Multidisciplinary Industrial Engineering ((LNMUINEN))

  • 2575 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Deb K, Beyer HG (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197–221

    Article  Google Scholar 

  2. Deb K, Goyal M (1999) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30–45

    Google Scholar 

  3. Deb K, Pratap A et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  4. Gaspar-Cunha A, Covas JA (2001) Robustness in multi-objective optimization using evolutionary algorithms. John Wiley & Sons, Inc

    Google Scholar 

  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–302

    Article  Google Scholar 

  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–267

    Article  Google Scholar 

  7. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: International Conference on Genetic Algorithms, pp 93–100

    Google Scholar 

  8. Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Cell Immunol 37(1):1–13

    MathSciNet  Google Scholar 

  9. Tukey JW (1978) Variations of box plots. Am Stat 32(1):12–16

    Google Scholar 

  10. Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

  11. Yu X, Gen M (2010) Introduction to Evolutionary Algorithms. Springer, London

    Book  MATH  Google Scholar 

  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–271

    Article  Google Scholar 

  13. Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. vol 3242, pp 95–100

    Google Scholar 

Download references

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenqiang Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Zhang, W., Wang, Y., Wang, C., Xiao, L., Gen, M. (2018). Fast Multiobjective Hybrid Evolutionary Algorithm Based on Mixed Sampling Strategy. In: Xu, J., Gen, M., Hajiyev, A., Cooke, F. (eds) Proceedings of the Eleventh International Conference on Management Science and Engineering Management. ICMSEM 2017. Lecture Notes on Multidisciplinary Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-59280-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59280-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59279-4

  • Online ISBN: 978-3-319-59280-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics