TY - GEN
T1 - A synthesized ranking-assisted NSGA-II for interval multi-objective optimization
AU - Zhang, Pengfei
AU - Xu, Ruidong
AU - Sun, Xiaoyan
AU - Gong, Dunwei
AU - Zhang, Yong
AU - Choi, Jong
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/11/14
Y1 - 2016/11/14
N2 - Multi-objective optimization problems with interval (MOPs-I) uncertainties parameters are common in practice. Evolutionary multi-objective (EMO) algorithms are popularly employed to solve these problems due to their powerful explorations. The comparison strategies among interval objectives of MOPs-I are crucially important for obtaining a superior Pareto front when applying EMOs. By effectively combining two different intervals ranking methods together, i.e., μ and P metrics, we present an improved NSGA-II with a synthesized intervals ranking strategy for optimizing MOPs-I. The characteristics of μ and P in ranking intervals are first analyzed, and then the synthesized ranking method termed as μ ⊕ P is developed to compare and select individuals within the NSGA-II framework. The proposed algorithm is experimentally validated by four MOPs-I functions and a practical problem, and the results empirically demonstrate its merits in obtaining Pareto front with outstanding convergence and spread.
AB - Multi-objective optimization problems with interval (MOPs-I) uncertainties parameters are common in practice. Evolutionary multi-objective (EMO) algorithms are popularly employed to solve these problems due to their powerful explorations. The comparison strategies among interval objectives of MOPs-I are crucially important for obtaining a superior Pareto front when applying EMOs. By effectively combining two different intervals ranking methods together, i.e., μ and P metrics, we present an improved NSGA-II with a synthesized intervals ranking strategy for optimizing MOPs-I. The characteristics of μ and P in ranking intervals are first analyzed, and then the synthesized ranking method termed as μ ⊕ P is developed to compare and select individuals within the NSGA-II framework. The proposed algorithm is experimentally validated by four MOPs-I functions and a practical problem, and the results empirically demonstrate its merits in obtaining Pareto front with outstanding convergence and spread.
KW - Evolutionary optimization
KW - Interval
KW - Interval ranking
KW - Multi-objective optimization
UR - http://www.scopus.com/inward/record.url?scp=85008253039&partnerID=8YFLogxK
U2 - 10.1109/CEC.2016.7743881
DO - 10.1109/CEC.2016.7743881
M3 - Conference contribution
AN - SCOPUS:85008253039
T3 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
SP - 861
EP - 868
BT - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
Y2 - 24 July 2016 through 29 July 2016
ER -