Skip to main content

Schemata-Driven Multi-objective Optimization

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

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

Included in the following conference series:

  • 2956 Accesses

Abstract

This paper investigates the exploitation of non-dominated sets’ schemata in guiding multi-objective optimization. Schemata capture the similarities between solutions in the non-dominated set. They also reflect the knowledge acquired by multi-objective evolutionary algorithms. A schemata-driven genetic algorithm as well as a schemata-driven local search algorithm are described. An experimental study to evaluate the suggested approach is then conducted.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. J. E. Baker. Reducing Bias and Inefficiency in the Selection Algorithm. In Second Intl. Conference on Genetic Algorithms, ICGA’2, pages 14–21, Pittsburg, 1987.

    Google Scholar 

  2. C. M. Fonseca and P. J. Fleming. An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evolutionary Computation, 3(1):1–16, 1995.

    Article  Google Scholar 

  3. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Learning. Addison-Wesley, 1989.

    Google Scholar 

  4. D. E. Goldberg and J. Richardson. Genetic Algorithms with Sharing for Multimodal Function Optimization. In Second Int. Conf. on Genetic Algorithms ICGA’2, pages 41–49, NJ, 1987. Lawrence Erlbaum.

    Google Scholar 

  5. M. P. Hansen and A. Jaskiewicz. Evaluating the Quality of Approximations to the Non-dominated Set. Technical Report IMM-REP-1998-7, Technical University of Denmark, March 1998.

    Google Scholar 

  6. J. H. Holland. Adaptation in Natural Artificial Systems. University of Michigan Press, 1975.

    Google Scholar 

  7. H. Ishibuchi and T. Murata. A Multi-objective Genetic Local Search Algorithm and its Application to Flowshop Scheduling. IEEE Transactions on Systems, Man, and Cybernetics — Part C: Applications and Reviews, 28(3):392–403, Aug 1998.

    Article  Google Scholar 

  8. J. Knowles and D. Corne. On Metrics for Comparing Non-dominated Sets, 2002.

    Google Scholar 

  9. J. D. Knowles and D. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149–172, 2000.

    Article  Google Scholar 

  10. Z. Michalewicz and J. Arabas. Genetic Algorithms for the 0/1_Knapsack Problem. In Zbigniew W. Raś and Maria Zemankova, editors, Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, volume 869 of LNAI, pages 134–143, Berlin, October 1994. Springer.

    Google Scholar 

  11. J. D. Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. In J. J. Grefenstette, editor, ICGA Int. Conf. on Genetic Algorithms, pages 93–100. Lawrence Erlbaum, 1985.

    Google Scholar 

  12. N. Srinivas and K. Deb. Multiobjective Optimisation Using Non-dominated Sorting in Genetic Algorithms. Evolutionary Computation, 2(8):221–248, 1995.

    Google Scholar 

  13. H. Tamaki, H. Kita, and S. Kobayashi. Multi-objective Optimization by Genetic Algorithms: A Review. In IEEE Int. Conf. on Evolutionary Computation ICEC’96, pages 517–522, 1996.

    Google Scholar 

  14. E. L. Ulungu and J. Teghem. The Two-phase Method: An Efficient Procedure to Solve Bi-objective Combinatorial Optimization Problems. In Foundations of Computing and Decision Sciences, volume 20, pages 149–165. 1995.

    MATH  MathSciNet  Google Scholar 

  15. E. L. Ulungu, J. Teghem, Ph. Fortemps, and D. Tuyttens. MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criteria Decision Analysis, 8(4):221–236, 1999.

    Article  MATH  Google Scholar 

  16. D. H. Wolpert and W. G. Macready. No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation, 1(1):67–82, April 1997.

    Article  Google Scholar 

  17. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In K. Giannakoglou, D. Tsahalis, J. Periaux, K. Papailiou, and T. Fogarty, editors, Evolutionary Methods for Design, Optimisation and Control. CIMNE, Barcelona, Spain, 2002.

    Google Scholar 

  18. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257–271, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kort, S. (2003). Schemata-Driven Multi-objective Optimization. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-36970-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-01869-8

  • Online ISBN: 978-3-540-36970-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics