Skip to main content

A Cluster-Based Evolutionary Algorithm for Multi-objective Optimization

  • Conference paper
  • First Online:
Computational Intelligence. Theory and Applications (Fuzzy Days 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2206))

Included in the following conference series:

  • 3564 Accesses

Abstract

In this paper a new evolutionary algorithm is described for multi-objective optimization. The new method handles non-linear objective functions and constraints and supports the decision-maker with an estimation of the Pareto set. This cluster-based method applies the Pareto-dominance principle. It approximates the Pareto set with the prototypes for each cluster and alternative prototypes as secondary population. The non-dominated set is continuously being up-dated: based on the Pareto ranking, the poorest clusters are regularly deleted, and the new ones are set.

The method solves the usual test problems with a satisfactory level of accuracy.

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. Borgulya I. (2000) Some polynomial programming problems solving with a clustering algorithm (in Hungarian) Alkalmazott Matematikai Lapok 20 19–34.

    MATH  MathSciNet  Google Scholar 

  2. Borgulya I (2000): Constrained optimization using a clustering algorithm Central European Journal of Operations Research. 8(1) 13–34.

    MATH  MathSciNet  Google Scholar 

  3. Cunha A.G., Oliveria P., Covas J.A. (1997) Use of Genetic Algoritms in Multicriteria Optimization to Solve Industrial Problems. Proc. Seventh Int. Conf. On Genetic Algorithms, Morgan Kauffman, 682–688.

    Google Scholar 

  4. Deb K. (1999): Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computing Vol. 7.No. 3. 205–230.

    Article  Google Scholar 

  5. Fonseca C. M, Fleming P. J. (1995): An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evolutionary Computing Vol. 3.No. 1. 1–16.

    Article  Google Scholar 

  6. Goldberg D.E. (1989). Genetic Algorithm for Search, Optimization and Machine Learning. Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  7. Gouljashki V. G, Kirilov L. M, Nerula S. C, Vassilev V. S. (1997): A reference Direction Interactive Algorithm of the Multiple Objective Nonlinear Integer Programming. In: Fandel G., Gal T. (ed.) Multiple criteria Decision Making, Springer Berlin. 308–317.

    Google Scholar 

  8. Laumann M, Rudolph G, Schwefel H-P. (1998): A Spatieel Predaton_Prey Approach to Multi-Objective Optimization: A preliminary Study. In Eihem A. E, Bäck T, Schoenauer M, Schwefel H-P (ed.) Parallel Problem Solving from Nature — PPSN V. Springer Berlin.

    Google Scholar 

  9. Miettiinen K, Mäkelä M. M. (2000): Interactive multiobjective optimization system WWW.NIMBUS on the Internet. Computer & Operations Research 27. 709–723.

    Article  Google Scholar 

  10. Richardson J., Palmer M., Liepins G., Hilliard M. (1989): Some guidelines for genetic algorithms with penalty functions Proc. of the 3th Int. Conf. on Genetic Algorithms, Morgan Kaufmann, Los Altos, pp. 19–197.

    Google Scholar 

  11. Rosenman M.A., Gero J.S. (1985). Reducing the Pareto optimal set in multivriteria optimization. Eng. Optim. 8, 189–206.

    Article  Google Scholar 

  12. Sakawa M. (1993) Fuzzy sets and interactive multiobjective optimization. Plenum Press, New York.

    MATH  Google Scholar 

  13. Sakawa M, Yauchi K. (1999): An interactive fuzzy satisficing method for multiobjective nonconvex programming problems through floating point genetic algorithm. European Journal of Operation Researches 117. 113–124.

    Article  MATH  Google Scholar 

  14. Srinivas N, Deb K. (1995): Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithm. Evolutionary Computing Vol. 2.No. 3. 221–248.

    Article  Google Scholar 

  15. Steuer R. E (1989): Multiple Criteria Optimization. R. E. Klieger Pub. Com. Florida.

    MATH  Google Scholar 

  16. Van Veldhuizen D. A, Lamont G. B. (2000): Multiobjective Evolutionary Algorithms: Analyzing the State-of-the Art. Evolutionary Computing Vol. 8. No.2. 125–147.

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borgulya, I. (2001). A Cluster-Based Evolutionary Algorithm for Multi-objective Optimization. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-45493-4_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42732-2

  • Online ISBN: 978-3-540-45493-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics