Skip to main content
SpringerLink
Log in

Improving NSGA-II Algorithm Based on Minimum Spanning Tree

  • Conference paper
Simulated Evolution and Learning (SEAL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5361))

Included in the following conference series:

Abstract

Diversity maintenance is an importance part of multi-objective evolutionary algorithm. In this paper, a new variant for the NSGA-II algorithm is proposed. The basic idea is that using the crowding distance method designed by minimum spanning tree to maintain the distribution of solutions. From an extensive comparative study with NSGA-II on a number of two and three objective test problems, it is observed that the proposed algorithm has good performance in distribution, and is also rather competitive to NSGA-II concerning the convergence.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, New York (2002)

    Book  MATH  Google Scholar 

  2. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)

    MATH  Google Scholar 

  3. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading (1989)

    MATH  Google Scholar 

  4. Fonseca, C.M., Fleming, P.J.: An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3(1), 1–16 (1995)

    Article  Google Scholar 

  5. Horn, J., Nafpliotis, N., Goldberg, D.E., Pareto, A.N.: Genetic Algorithm for Multiobjective Optimization. In: Proceeding of the first IEEE Congress on Evolutionary Computation (CEC 1994), pp. 82–87 (1994)

    Google Scholar 

  6. Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation 2(3), 221–248 (1994)

    Article  Google Scholar 

  7. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  8. Zitzler, E., Thiele, L.: An evolutionary algorithm for Multiobjective optimization: The strength Pareto approach. Technical Report 43, Gloriastrasse 35, CH-8092 Zurich, Switzerland (1998)

    Google Scholar 

  9. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-Report 103 (2001)

    Google Scholar 

  10. Knowles, J., Corne, D.: Approximating the nondominated front using the Pareto archive evolutionary strategy. Evolutionary Computation 8(2), 149–172 (2000)

    Article  Google Scholar 

  11. Knowles, J., Corne, D.: M-PAES: A Memetic Algorithm for Multiobjective Optimization. In: Proceeding of IEEE Congress on Evolutionary Computation (CEC 2000), pp. 325–332 (2000)

    Google Scholar 

  12. Knowles, J.D., Corne, D.W., Fleischer, M.: Bounded Archiving using the Lebesgue Measure. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2003), pp. 2490–2497 (2003)

    Google Scholar 

  13. Kukkonen, S., Deb, K.: Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems. In: Proceedings of IEEE on Evolutionary Computation (CEC 2006), pp. 3995–4002 (2006)

    Google Scholar 

  14. Li, M., Zheng, J., Xiao, G.: An Efficient Multi-objective Evolutionary Algorithm Based on Minimum Spanning Tree. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2008), pp. 617–624 (2008)

    Google Scholar 

  15. Corne, D.W., Jerram, N.R., Knowles, J.D., Oates, M.J.: PESA-II: Region-based Selection in Evolutionary Multiobjective Optimization. In: Spector, L., Goodman, E., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 283–290. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  16. Knowles, J., Corne, D.: Properties of an Adaptive Archiving Algorithm for Storing Nondominated Vectors. IEEE Transactions on Evolutionary Computation 7(2), 100–116 (2003)

    Article  Google Scholar 

  17. Aguirre, H., Tanaka, K.: Selection, drift, recombination, and mutation in multiobjective evolutionary algorithms on scalable mnk-landscapes. In: Proceedings of the 3rd International Conference on Evolutionary Multi-Criterion Optimization (EMO 2005), Guanajuato, Mexico, pp. 355–369 (March 2005)

    Google Scholar 

  18. Kukkonen, S., Lampinen, J.: GDE3: The third evolution step of Generalized Differential Evolution. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2005), pp. 443–450 (2005)

    Google Scholar 

  19. Raquel, C.R., Naval Jr., P.C.: An effective use of crowding distance in multiobjective particle swarm optimization. In: Proceedings of the Genetic and Evolutionary Computation (GECCO 2005), Washington, DC, USA, June, pp. 257–264 (June 2005)

    Google Scholar 

  20. Coello, C.A.C.: 20 Years of Evolutionary Multi-Objective Optimization: What Has Been Done and What Remains to be Done. In: Yen, G.Y., Fogel, D.B. (eds.) Computational Intelligence: Principles and Practice, ch. 4, pp. 73–88. IEEE Computational Intelligence Society (2006)

    Google Scholar 

  21. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, pp. 105–145 (2005)

    Google Scholar 

  22. Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2), 173–195 (2000)

    Article  Google Scholar 

  23. Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Computation and Convergence to a Pareto Front. In: Koza, J.R. (ed.) Late Breaking Papers at the Genetic Programming Conference, pp. 221–228 (1998)

    Google Scholar 

  24. Schott, J.R.: Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. Master’s thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology (1995)

    Google Scholar 

  25. Li, M., Zheng, J., Xiao, G.: Uniformity Assessment for Evolutionary Multi-Objective Optimization. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2008), pp. 625–632 (2008)

    Google Scholar 

  26. Sierra, M.R., Coello, C.A.C.: A Study of Fitness Inheritance and Approximation Techniques for Multi-Objective Particle Swarm Optimization. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2005), pp. 65–72 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Engineering, Xiangtan University, 411105, Hunan, China

    Miqing Li, Jinhua Zheng & Jun Wu

Authors
  1. Miqing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinhua Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  2. Melbourne School Engineering, Department of Computer Science and Software Engineering, The University of Melbourne, VIC 3001, Melbourne, Australia

    Michael Kirley

  3. School of Mathematics, Statistics and Computer Science, Victoria University of Wellington, P.O. Box 600, 6140, Wellington, New Zealand

    Mengjie Zhang

  4. Faculty of Information Technology, Monash University, Clayton Campus, VIC 3800, Australia

    David Green

  5. School of Computer Science and Information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Vic Ciesielski

  6. School of Information Technology and Electrical Engineering, Australian Defence Force Academy, University of New South Wales, Canberra, Australia

    Hussein Abbass

  7. School of Computer Science, University of Adelaide, SA 5005, Adelaide, Australia

    Zbigniew Michalewicz

  8. Faculty of Information and Communication Technologies, Swinburne University of Technology, Melbourne, Australia

    Tim Hendtlass

  9. Indian Institute of Technology Kanpur, Department of Mechanical Engineering, Kanpur Genetic Algorithms Laboratory (KanGAL), 208016, Kanpur, Uttar Pradesh, India

    Kalyanmoy Deb

  10. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, 117576, Singapore

    Kay Chen Tan

  11. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  12. Xi’an Jiaotong-Liverpool University, 215123, Suzhoum, China

    Yuhui Shi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, M., Zheng, J., Wu, J. (2008). Improving NSGA-II Algorithm Based on Minimum Spanning Tree. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89694-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89693-7

  • Online ISBN: 978-3-540-89694-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation