Article ID: | iaor2014294 |
Volume: | 48 |
Issue: | 6 |
Start Page Number: | 1057 |
End Page Number: | 1073 |
Publication Date: | Dec 2013 |
Journal: | Structural and Multidisciplinary Optimization |
Authors: | Fu Yan, Shi Lei, Yang Ren-Jye, Zhu Ping, Wang Bo-Ping |
Keywords: | programming: multiple criteria, datamining |
One of the major challenges for solving large‐scale multi‐objective optimization design problems is to find the Pareto set effectively. Data mining techniques such as classification, association, and clustering are common used in computer community to extract useful information from a large database. In this paper, a data mining technique, namely, Classification and Regression Tree method, is exploited to extract a set of reduced feasible design domains from the original design space. Within the reduced feasible domains, the first generation of designs can be selected for multi‐objective optimization to identify the Pareto set. A mathematical example is used to illustrate the proposed method. Two industrial applications are used to demonstrate the proposed methodology that can achieve better performances in terms of both accuracy and efficiency.