Skip to main content

An Improved NSGA-II Algorithm and Its Application

  • Conference paper
  • First Online:
Cyberspace Data and Intelligence, and Cyber-Living, Syndrome, and Health (CyberDI 2019, CyberLife 2019)

Abstract

The NSGA-II algorithm is widely used in multi-objective optimization problems, but the traditional NSGA-II algorithm has some shortcomings such as large computational cost and poor convergence in some complex practical problems. To solve above defections, an improved NSGA-II algorithm is proposed in this paper. Firstly, the specific crossover and mutation operators are designed. Secondly, a novel elitist strategy is developed as well. Then, the simulations of the standard test functions are carried out, the results illustrate that the improved strategies can effectively enhance the convergence and operation speed of the traditional algorithm. Finally, in order to test the practicality of the algorithm, a multi-objective mathematical model for charge plan of steelmaking is established. Simulation is carried out with real industry data. The results show that the algorithm is practical for charge scheduling.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Chen, G.: Multi-objective optimization method based on agent model and its application in vehicle body design. Hunan University (2012)

    Google Scholar 

  2. Srinivas, N., Deb, K.: Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. MIT Press, Cambridge (1994)

    Google Scholar 

  3. Alikar, N., Mousavi, S., Ghazilla, R., et al.: Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system. Reliab. Eng. Syst. Saf. 160, 1–10 (2017)

    Article  Google Scholar 

  4. Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multiobjective genetic algorithm. IEEE Trans. Evol. Comput. 6(2), 0–197 (2002)

    Article  Google Scholar 

  5. Mason, S.J., Kurz, M.E., Pfund, M.E., et al.: Multi-objective semiconductor manufacturing scheduling: a random keys implementation of NSGA-II. In: IEEE Symposium on Computational Intelligence in Scheduling. IEEE (2007)

    Google Scholar 

  6. Ma, E.J., Chai, T.Y., Bai, R.: The optimization methods based on non-dominated sorting genetic algorithm for scheduling of material flow in mineral process. In: IMACS Multiconference on Computational Engineering in Systems Applications. IEEE (2006)

    Google Scholar 

  7. Chen, X., Zhao, L., Liang, H., et al.: Matching patients and healthcare service providers: a novel two-stage method based on knowledge rules and OWA-NSGA-II algorithm. J. Comb. Optim. (2017)

    Google Scholar 

  8. Deb, K., Goyal, M.: A combined genetic adaptive search (GeneAS) for engineering design. Comput. Sci. Inform. 26(4), 30–45 (1996)

    Google Scholar 

  9. Zhang, M., Luo, W.J., Wang, X.F.: A normal distribution crossover for ε-MOEA: a normal distribution crossover for ε-MOEA. J. Softw. 20(2), 305–314 (2009)

    Article  MathSciNet  Google Scholar 

  10. Storn, R., Price, K.V.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)

    Article  MathSciNet  Google Scholar 

  11. Veldhuizen, D.A., Lamont, G.B.: Evolutionary Computation and Convergence to a Pareto Front, pp. 221–228. Stanford University Bookstore (1998)

    Google Scholar 

  12. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)

    Article  Google Scholar 

  13. Coello, C., Pulido, G.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256–279 (2004)

    Article  Google Scholar 

  14. Hu, K.-Y., Gao, Z.-W., Wang, D.: Optimal multi-objective model and algorithm for order matching problems in iron & steel plants. J. Northeast. Univ. 25(6), 527–530 (2004)

    Google Scholar 

  15. Yang, J., Wang, B., Zou, C., et al.: Optimal charge planning model of steelmaking based on multi-objective evolutionary algorithm. Metals 8(7), 483 (2018)

    Article  Google Scholar 

  16. Yu, S., Lv, R., Zheng, B., et al.: Simulation system for logistics in steelmaking process based on Flexsim. In: CCDC (2009)

    Google Scholar 

  17. Xue, Y., Zheng, D., Yang, Q.: Optimal furnace scheduling for steelmaking and continuous casting based on improved discrete particle swarm optimization. Comput. Integr. Manuf. Syst. 17(07), 1509–1517 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiqiu Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, X., Liu, Z., Wang, C., Shang, Y. (2019). An Improved NSGA-II Algorithm and Its Application. In: Ning, H. (eds) Cyberspace Data and Intelligence, and Cyber-Living, Syndrome, and Health. CyberDI CyberLife 2019 2019. Communications in Computer and Information Science, vol 1137. Springer, Singapore. https://doi.org/10.1007/978-981-15-1922-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-1922-2_41

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-1921-5

  • Online ISBN: 978-981-15-1922-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics