Skip to main content

Adapting Weighted Aggregation for Multiobjective Evolution Strategies

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2001)

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

Included in the following conference series:

Abstract

The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will lead the population to the Pareto front. Two possible methods are investigated. One method is to assign a uniformly distributed random weight to each individual in the population in each generation. The other method is to change the weight periodically with the process of the evolution. We found in both cases that the population is able to approach the Pareto front, although it will not keep all the found Pareto solutions in the population. Therefore, an archive of non-dominated solutions is maintained. Case studies are carried out on some of the test functions used in [1] and [2]. Simulation results show that the proposed approaches are simple and effective.

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. E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolution algorithms: empirical results. Evolutionary Computation, 8(2):173–195, 2000.

    Article  Google Scholar 

  2. J. D. Knowles and D. W. Corne. Approximating the nondominated front using the Pareto archived evolution strategies. Evolutionary Computation, 8(2):149–172, 2000.

    Article  Google Scholar 

  3. C.A.C. Coello. A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information Systems, 1(3):269–308, 1999.

    Google Scholar 

  4. C. M. Fonseca and P. J. Fleming. Multiobjective optimization. In Th. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Evolutionary Computation, volume 2, pages 25–37. Institute of Physics Publishing, Bristol, 2000.

    Google Scholar 

  5. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithms: Analyzing the state-of-art. Evolutionary Computation, 8(2):125–147, 2000.

    Article  Google Scholar 

  6. P. Hajela and C. Y. Lin. Genetic search strategies in multicriteria optimal design. Structural Optimization, 4:99–107, 1992.

    Article  Google Scholar 

  7. F. Kursawe. A variant of evolution strategies for vector optimization. In H.-P. Schwefel and R. Männer, editors, Parallel Problem Solving from Nature, volume I, pages 193–197, 1991.

    Google Scholar 

  8. T. Binh and U. Korn. Multiobjective evolution strategy with linear and nonlinear constraints. In Proceedings of the 15th IMACS World Congress on Scientific Conputation, Modeling and Applied Mathematics, pages 357–362, 1997.

    Google Scholar 

  9. M. Laumanns, G. Rudolph, and H.-P. Schwefel. A spatial predator-prey approach to multi-objective optimization. In A.E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature, volume V, pages 241–249, 1998.

    Google Scholar 

  10. J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. In Proceedins of an International Conference on Genetic Algorithms and Their Applications, pages 93–100, 1985.

    Google Scholar 

  11. H.-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technologies Series. John Wiley & Sons, Inc., 1994.

    Google Scholar 

  12. N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaption. In Proc. 1996 IEEE Int. Conf. on Evolutionary Computation, pages 312–317. IEEE Press, 1996.

    Google Scholar 

  13. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 2000. To appear.

    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

Jin, Y., Okabe, T., Sendho, B. (2001). Adapting Weighted Aggregation for Multiobjective Evolution Strategies. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds) Evolutionary Multi-Criterion Optimization. EMO 2001. Lecture Notes in Computer Science, vol 1993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44719-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44719-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41745-3

  • Online ISBN: 978-3-540-44719-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics