Skip to main content

A Multi-Objective Genetic Algorithm Based on Density

  • Conference paper
Book cover Advances in Computation and Intelligence (ISICA 2007)

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

Included in the following conference series:

Abstract

This paper presents a new kind of MOEA, namely DMOGA (Density based Multi-Objective Genetic Algorithm). After discussing the influence function and the density function, we employ density of a solution point as its fitness in order to make the DMOGA perform well on diversity. And then, we extend our discussions to fitness assignment and computation, pruning procedure when the non-dominated set is bigger than the size of evolutionary population, and selection from the environmental selection population. To make DMOGA more efficient, we propose to construct the non-dominated set with the Dealer’s Principle. We compare our DMOGA with two popular MOEAs, and the experimental results are satisfactory.

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 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. Corne, D.W., Knowles, J.D., Oates, M.J.: The Pareto envelope based selection algorithm for multi-objective optimization. In: Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 839–848 (2000)

    Google Scholar 

  2. Corne, D.W., Jerram, N.R., Knowles, J.D., Oates, M.J.: PESA-II: Region-based Selection in Evolutionary Multiobjective Optimization. In: GECCO-2001. Proceedings of the Genetic and Evolutionary Computation Conference, pp. 283–290. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  3. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multi-Objective Optimization. KanGAL Report Number 2001001 (2001)

    Google Scholar 

  4. Deb, K., Pratap, A., Agrawal, S., Meyrivan, T.: A Fast and Elitist Multi-objective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  5. Deb, K., Mohan, M., Mishra, S.: A Fast Multi-objective Evolutionary Algorithm for Finding Well-Spread Pareto-Optimal Solutions. KanGAL Report No. 2003002 (February 2003)

    Google Scholar 

  6. Farhang-Mehr, A., Azarm, S.: Diversity Assessment of Pareto Optimal Solution Sets: An Entropy Approach. In: CEC 2002. Congress on Evolutionary Computation, May 2002, vol. 1, pp. 723–728. IEEE Service Center, Piscataway, New Jersey (2002)

    Google Scholar 

  7. Fonseca, C.M., Fleming, P.J.: Genetic Algorithms for Multiobjective Optimization: Formulation, discussion and Generalization. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 416–423. University of Illinois at Urbana-Champaign, Morgan Kauffman Publishers (1993)

    Google Scholar 

  8. Horn, J., Nafpliotis, N.: Multiobjective Optimization using the Niched Pareto Genetic Algorithm, Technical Report IlliGAl Report 93005. University of Illinois at Urbana-Champaign, Urbana, Illinois, USA (1993)

    Google Scholar 

  9. Horn, J., Nafpliotis, N., Goldberg, D.E.: A Niched Pareto genetic Algorithm for Multiobjective Optimization. In: Proceeding of the first IEEE Conference on Evolutionary Computation, pp. 82–87. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  10. Schaffer, J.D.: Multi objective optimization with vector evaluated genetic algorithms. In: Grefenstette, J. (ed.) Proceedings of an International Conference on Genetic Algorithms and their Applications, pp. 93–100 (1985)

    Google Scholar 

  11. Zheng, J., Shi, Z., Ling, C.X., Xie, Y.: A New Method to Construct the Non-Dominated Set in Multi-Objective Genetic Algorithms. IIP 2004, Beijing, 2004.10 (to appear)

    Google Scholar 

  12. Zitzler, E., Thiele, L.: Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)

    Article  Google Scholar 

  13. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multi-objective Optimization. EUROGEN 2001 - Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (September 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lishan Kang Yong Liu Sanyou Zeng

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, J., Xiao, G., Song, W., Li, X., Ling, C.X. (2007). A Multi-Objective Genetic Algorithm Based on Density. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74581-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74580-8

  • Online ISBN: 978-3-540-74581-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics