An Expensive Multi-objective Optimization Algorithm Based on Decision Space Compression

Haosen Liu, Fangqing Gu*, Yiu Ming Cheung

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

2 Citations (Scopus)
6 Downloads (Pure)


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.
Original languageEnglish
Article number2159039
Number of pages19
JournalInternational Journal of Pattern Recognition and Artificial Intelligence
Issue number9
Publication statusPublished - Jul 2021

Scopus Subject Areas

  • Software
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

User-Defined Keywords

  • Decision space compression
  • expensive multi-objective
  • evolutionary algorithm


Dive into the research topics of 'An Expensive Multi-objective Optimization Algorithm Based on Decision Space Compression'. Together they form a unique fingerprint.

Cite this