Abstract
In this paper the method of selecting a representative subset of Pareto optimal solutions is used to make the search of Pareto frontier more effective. Firstly, the evolutionary algorithm method for generating a set of Pareto optimal solutions is described. Then, indiscernibility interval method is applied to select representative subset of Pareto optimal solutions. The main idea of this method consists in removing from the set of Pareto optimal solutions these solutions, which are close to each other in the space of objectives, i.e., those solutions for which the values of the objective functions differ less than an indiscernibility interval. The set of Pareto optimal solutions is reduced using indiscernibility interval method after running a certain number of generations. This process can be called the filtration process in which less important Pareto optimal solutions are removed from the existing set. Finally, two design optimization problems are solved using the proposed method. From these examples it is clear that the computation time can be reduced significantly and still the real Pareto frontier obtained.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coello C. A. C. (1999) A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques, Knowledge and Information Systems, Vol. 1, No. 3, pp. 269–308.
Krenich, S. & Osyczka, A. (2000): Optimization of Robot Grippers Parameters Using Genetic Algorithms. The 13th CISM-IFToMM Symposium on the Theory and Practice of Robots and Manipulators. July 3-6, 2000, Zakopane, Poland.
Montusiewicz J. (1999) Division of the Set of Nondominated Solutions by Means of the Undifferentiation Interval Method, In: The Technological Information Systems, pp. 65–72, Societas Scientiarum Lublinensis, Lublin.
Osyczka A., Montusiewicz J. (1994) A Random Search Approach to Multicriterion Discrete Optimization, IUTAM Symposium on Discrete Structural Optimization, Springer-Verlag, pp. 71–79.
Osyczka A., Tamura H., Saito Y. (1997) Pareto Set Distribution Method for Multicriteria Design Optimization Using Genetic Algorithm, In: Proceedings of Engineering Design and Automation Conference, Bangkok, Thailand, pp. 228–231.
Osyczka A., Tamura H. (1996) Pareto Set Distribution Method for Multicriteria Optimization Using Genetic Algorithm, In: Proceedings of Genetic Algorithms’ 96, (MENDEL-96)-International Conference, Brno, Czech Republic, pp.135–143.
Steuer R.E. (1986) Multiple Criteria Optimization-Theory, Computation and Application, Wiley, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osyczka, A., Krenich, S. (2001). Evolutionary Algorithms for Multicriteria Optimization with Selecting a Representative Subset of Pareto Optimal Solutions. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-44719-9_10
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