Bibliographic Details
| Title: |
An Expensive Multi-Objective Optimization Algorithm Based on Decision Space Compression. |
| Authors: |
Liu, Haosen, Gu, Fangqing, Cheung, Yiu-Ming |
| Source: |
International Journal of Pattern Recognition & Artificial Intelligence; Jul2021, Vol. 35 Issue 9, p1-19, 19p |
| Subject Terms: |
MATHEMATICAL optimization, STATISTICAL decision making, EVOLUTIONARY algorithms, DATA compression, ALGORITHMS |
| Abstract: |
Numerous surrogate-assisted expensive multi-objective optimization algorithms were proposed to deal with expensive multi-objective optimization problems in the past few years. The accuracy of the surrogate models degrades as the number of decision variables increases. In this paper, we propose a surrogate-assisted expensive multi-objective optimization algorithm based on decision space compression. Several surrogate models are built in the lower dimensional compressed space. The promising points are generated and selected in the lower compressed decision space and decoded to the original decision space for evaluation. Experimental studies show that the proposed algorithm achieves a good performance in handling expensive multi-objective optimization problems with high-dimensional decision space. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Pattern Recognition & Artificial Intelligence is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Nájsť tento článok vo Web of Science