Journal article
REDUCING THE PARETO OPTIMAL SET IN MULTICRITERIA OPTIMIZATION(With Applications to Pareto Optimal Dynamic Programming)
Engineering optimization, v 8(3), pp 189-206
01 Jan 1985
Abstract
This paper describes the rationale for using clustering methods to reduce the size of the Pareto optimal set whilst retaining its shape. It proceeds lo describe an implementation of the complete-linkage clustering method and demonstrates its application. Finally, the method is incorporated into a Pareto optimal serial dynamic programming process to reduce the size of the Pareto optimal set generated at each stage of the optimization.
Metrics
1 Record Views
Details
- Title
- REDUCING THE PARETO OPTIMAL SET IN MULTICRITERIA OPTIMIZATION(With Applications to Pareto Optimal Dynamic Programming)
- Creators
- M. A. Rosenman - The University of SydneyJ. S. Gero - The University of Sydney
- Publication Details
- Engineering optimization, v 8(3), pp 189-206
- Publisher
- Taylor & Francis Group
- Number of pages
- 18
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Psychological and Brain Sciences (Psychology)
- Web of Science ID
- WOS:A1985AJL1500002
- Scopus ID
- 2-s2.0-0011374085
- Other Identifier
- 991022202934404721