Abstract
Despite the huge amount of methods available in literature, the practical use of multiobjective optimization tools in industry is still an open issue. A strategy to reduce objective function evaluations is essential, at a fixed degree of Pareto optimal front () approximation accuracy. To this aim, an extension of single objective Generalized response surface (GRS) methods to approximation is proposed. Such an extension is not at all straightforward due to the usually complex shape of the Pareto optimal set () as well as the non-linear relation between the and the . As a consequence of such complexity, it is extremely difficult to identify a multiobjective analogue of single objective current optimum region. Consequently, the design domain search space zooming strategy around the current optimum region, which is the core of a GRS method, has to be carefully reconsidered when approximation is concerned. In this paper, a GRS strategy for multiobjective optimization is proposed. This strategy links the optimization (based on evolutionary computation) to the interpolation (based on Neural Networks). The strategy is explained in detail and tested on various test cases. Moreover, a detailed analysis of approximation errors and computational cost is given together with a description of real-life applications.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
The collaboration with the following colleagues is warmly acknowledged: Dr. A. Bramanti and Prof. P. Di Barba (University of Pavia, Department of Electrical Engineering, IT) for the multiobjective real-life example, Dr. K. Rashid (Schlumberger Cambridge, UK) for the single objective real-life example, and Professor J.K. Sykulski (University of Southampton, Department of Electronics and Computer Science, UK) for the ES/DE/MQ method.
Rights and permissions
About this article
Cite this article
Farina, M., Amato, P. Linked interpolation-optimization strategies for multicriteria optimization problems. Soft Computing 9, 54–65 (2005). https://doi.org/10.1007/s00500-003-0334-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-003-0334-7