Skip to main content

Optimizing Interval Multi-objective Problems Using IEAs with Preference Direction

  • Conference paper
Neural Information Processing (ICONIP 2011)

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

Included in the following conference series:

Abstract

Interval multi-objective optimization problems (MOPs) are popular and important in real-world applications. We present a novel interactive evolutionary algorithm (IEA) incorporating an optimization-cum-decision-making procedure to obtain the most preferred solution that fits a decision-maker (DM)’s preferences. Our method is applied to two interval MOPs and compared with PPIMOEA and the posteriori method, and the experimental results confirm the superiorities of our method.

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. Zhao, Z.H., Han, X., Jiang, C., Zhou, X.X.: A Nonlinear Interval-based Optimization Method with Local-densifying Approximation Technique. Struct. Multidisc. Optim. 42, 559–573 (2010)

    Article  Google Scholar 

  2. Limbourg, P., Aponte, D.E.S.: An Optimizaiton Algorithm for Imprecise Multi-objective Problem Function. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 459–466. IEEE Press, New York (2005)

    Google Scholar 

  3. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  4. Branke, J., Deb, K., Miettinen, K., Słowiński, R. (eds.): Multiobjective Optimization - Interactive and Evolutionary Approaches. LNCS, vol. 5252. Springer, Heidelberg (2008)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Deb, K., Kumar, A.: Interactive Evolutionary Multi-objective Optimization and Decision-making Using Reference Direction Method. Technical report, KanGAL (2007)

    Google Scholar 

  7. Fowler, J.W., Gel, E.S., Koksalan, M.M., Korhonen, P., Marquis, J.L., Wallenius, J.: Interactive Evolutionary Multi-objective Optimization for Quasi-concave Preference Functions. Eur. J. Oper. Res. 206, 417–425 (2010)

    Article  MATH  Google Scholar 

  8. Sun, J., Gong, D.W., Sun, X.Y.: Solving Interval Multi-objective Optimization Problems Using Evolutionary Algorithms with Preference Polyhedron. In: Genetic and Evolutionary Computation Conference, pp. 729–736. ACM, NewYork (2011)

    Google Scholar 

  9. Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, J., Gong, D., Sun, X. (2011). Optimizing Interval Multi-objective Problems Using IEAs with Preference Direction. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24958-7_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24958-7_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24957-0

  • Online ISBN: 978-3-642-24958-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics