Pareto rank learning in multi-objective evolutionary algorithms
In this paper, the interest is on cases where assessing the goodness of a solution for the problem is costly or hazardous to construct or extremely computationally intensive to compute. We label such category of problems as “expensive” in the present study. In the context of multi-objective evolutio...
Saved in:
Main Authors: | Seah, Chun-Wei, Ong, Yew Soon, Tsang, Ivor Wai-Hung, Jiang, Siwei |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/97348 http://hdl.handle.net/10220/12018 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Evolving the tradeoffs between Pareto-optimality and robustness in multi-objective evolutionary algorithms
by: Goh, C.K., et al.
Published: (2014) -
Multi co-objective evolutionary optimization : cross surrogate augmentation for computationally expensive problems
by: Le, Minh Nghia, et al.
Published: (2013) -
An ensemble approach to multi-objective evolutionary algorithm
by: Pratama, Januar Ananta Dinar
Published: (2019) -
Evolutionary optimization of expensive multiobjective problems with co-sub-Pareto front Gaussian process surrogates
by: Luo, Jianping, et al.
Published: (2021) -
Pareto optimization with small data by learning across common objective spaces
by: Tan, Chin Sheng, et al.
Published: (2023)