Skip to main content

Interactive Evolutionary Algorithms with Decision-Maker’s Preferences for Solving Interval Multi-objective Optimization Problems

  • Conference paper
Emerging Intelligent Computing Technology and Applications (ICIC 2012)

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

Included in the following conference series:

  • 2328 Accesses

Abstract

Multi-objective optimization problems (MOPs) with interval parameters are considerably popular and important in real-world applications. A novel evolutionary algorithm incorporating with a decision-maker (DM)’s preferences is presented to obtain their Pareto subsets which meet the DM’s preferences in this study. The proposed algorithm is applied to four MOPs with interval parameters and compared with other two algorithms. The experimental results confirm the advantages of the proposed algorithm.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gong, D.W., Qin, N.N., Sun, X.Y.: Evolutionary Algorithms for Multi-objective Optimization Problems with Interval Parameters. In: 5th IEEE International Conference on Bio-Inspired Computing: Theories and Applications, pp. 411–420 (2010)

    Google Scholar 

  2. Yang, D.D., Jiao, L.C., Gong, M.G., Yu, H.: Clone Selection Algorithm to Solve Prefer-ence Multi-objective Optimization. Journal of Software 21, 14–33 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Luque, M., Miettinen, K., Eskelinen, P., Ruiz, F.: Incorporating Preference Information in Interactive Reference Point Methods for Multiobjective Optimization. Omega 37, 450–462 (2009)

    Article  Google Scholar 

  4. Rachmawati, L., Srinivasan, D.: Incorporating the Notion of Relative Importance of Ob-jectives in Evolutionary Multiobjective Optimization. IEEE Transactions on Evolution-ary Computation 14, 530–546 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolution-ary Mul-tiobjective Optimization: Theoretical Advances and Applications, pp. 105–145. Springer, New York (2005)

    Google Scholar 

  7. Limbourg, P., Aponte, D.E.: An Optimization Algorithm for Imprecise Multi-objective Problem Functions. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 459–466. IEEE Press, New York (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gong, D., Ji, X., Sun, J., Sun, X. (2012). Interactive Evolutionary Algorithms with Decision-Maker’s Preferences for Solving Interval Multi-objective Optimization Problems. In: Huang, DS., Gupta, P., Zhang, X., Premaratne, P. (eds) Emerging Intelligent Computing Technology and Applications. ICIC 2012. Communications in Computer and Information Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31837-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31837-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31836-8

  • Online ISBN: 978-3-642-31837-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics