Skip to main content

An Improved Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization Based on Crowding Distance

  • Conference paper
  • 2415 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 462))

Abstract

An improved non-dominated sorting genetic algorithm (INSGA) is introduced for multi-objective optimization. In order to keep the diversity of the population, a modified elite preservation strategy is adopted and the evaluation of solutions’ crowding degree is integrated in crossover operations during the evolution. The INSGA is compared with the NSGA-II and other algorithms by applications to five classical test functions and an environmental/economic dispatch (EED) problem in power systems. It is shown that the Pareto solution obtained by INSGA has a good convergence and diversity.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deb, K.: Multi-objective optimization. Search Methodologies, pp. 403–449. Springer US (2014)

    Google Scholar 

  2. Deb, K.: Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, Chichester (2001)

    MATH  Google Scholar 

  3. Fonseca, C.M., Fleming, P.J.: Genetic Algorithms for Multi-objective Optimization: Formulation Discussion and Generalization. In: ICGA, vol. 93, pp. 416–423 (1993)

    Google Scholar 

  4. Zitzler, E.: Evolutionary algorithms for multi-objective optimization: Methods and applications. Shaker, Ithaca (1999)

    Google Scholar 

  5. Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  6. Valenzuela, J., Smith, A.E.: A seeded memetic algorithm for large unit commitment problems. Journal of Heuristics 8(2), 173–195 (2002)

    Article  Google Scholar 

  7. Santana, R.A., Pontes, M.R., Bastos-Filho, C.J.A.: A multiple objective particle swarm optimization approach using crowding distance and roulette wheel. In: Ninth International Conference on Intelligent Systems Design and Applications, ISDA 2009, pp. 237–242. IEEE (2009)

    Google Scholar 

  8. Wang, L.: Research on Genetic Algorithms for Multi-Objective Optimization Algorithms. Wuhan University of Technology, Wuhan (2006)

    Google Scholar 

  9. Zahavi, J., Eisenberg, L.: An application of the Economic-environmental power dispatch. IEEE Transactions on Systems, Man and Cybernetics 7(7), 523–530 (1977)

    Article  Google Scholar 

  10. Senjyu, T., Shimabukuro, K., Uezato, K., et al.: A fast technique for unit commitment problem by extended priority list. IEEE Transactions on Power Systems 18(2), 882–888 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, Tl., Zhang, Sh. (2014). An Improved Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization Based on Crowding Distance. In: Fei, M., Peng, C., Su, Z., Song, Y., Han, Q. (eds) Computational Intelligence, Networked Systems and Their Applications. ICSEE LSMS 2014 2014. Communications in Computer and Information Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45261-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45261-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45260-8

  • Online ISBN: 978-3-662-45261-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics