Skip to main content

Tailoring ε-MOEA to Concept-Based Problems

  • Conference paper

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

Abstract

Concept-based MOEAs are tailored MOEAs that aim at solving problems with a-priori defined subsets of solutions that represent conceptual solutions. In general, the concepts’ subsets may be associated with different search spaces and the related mapping into a mutual objective space could have different characteristics from one concept to the other. Of a particular interest are characteristics that may cause premature convergence due to local Pareto-optimal sets within at least one of the concept subsets. First, the known ε-MOEA is tailored to cope with the aforementioned problem. Next, the performance of the new algorithm is compared with C1-NSGA-II. Concept-based test cases are devised and studied. In addition to demonstrating the significance of premature convergence in concept-based problems, the presented comparison suggests that the proposed tailored MOEA should be preferred over C1-NSGA-II. Suggestions for future work are also included.

Keywords

  • Premature Convergence
  • Decision Space
  • Population Member
  • Concept Selection
  • Offspring Solution

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moshaiov, A., Avigad, G.: Concept-based Multi-objective Problems and Their Solution by EC. In: Proc. of the GECCO 2007 Workshop on User Centric Evolutionary Computation, GECCO, London (2007)

    Google Scholar 

  2. Avigad, G., Moshaiov, A.: Set-based Concept Selection in Multi-objective Problems: Optimality versus Variability Approach. J. of Eng. Design 20(3), 217–242 (2009)

    CrossRef  Google Scholar 

  3. Denenberg, E., Moshaiov, A.: Evolutionary Search of Optimal Concepts using a Relaxed-Pareto-optimality Approach. In: Proc. of the IEEE Congress on Evolutionary Computations, CEC 2009, Trondheim, Norway, pp. 1093–1100 (2009)

    Google Scholar 

  4. Mattson, C.A., Messac, A.: Pareto Frontier based Concept Selection under Uncertainty with Visualization. Optimization and Engineering 6, 85–115 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Mattson, C.A., Mullur, A.A., Messac, A.: Case Studies in Concept Exploration and Selection with s-Pareto Frontiers. Int. J. of Product Development, Special Issue on Space Exploration and Design Optimization 9(1/2/3), 32–59 (2009)

    Google Scholar 

  6. Avigad, G., Moshaiov, A.: Simultaneous Concept based Evolutionary Multiobjective Optimization. Applied Soft Computing 11(1), 193–207 (2011)

    CrossRef  Google Scholar 

  7. Deb, K., Mohan, M., Mishra, S.: Evaluating the ε-domination based Multi-objective Evolutionary Algorithm for a Quick Computation of Pareto-optimal Solutions. Evolutionary Computation 16(3), 355–384 (2005)

    Google Scholar 

  8. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Tran. on Evolutionary Computation 6, 182–197 (2002)

    CrossRef  Google Scholar 

  9. Deb, K., Tiwari, S.: Omni-optimizer: A Generic Evolutionary Algorithm for Single and Multi-objective Optimization. European J. of Operational Research 185(3), 1062–1087 (2008)

    CrossRef  MathSciNet  MATH  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

Moshaiov, A., Snir, Y. (2012). Tailoring ε-MOEA to Concept-Based Problems. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32964-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32964-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)