TY - GEN
T1 - Combination of EDA and DE for continuous biobjective optimization
AU - Zhou, Aimin
AU - Zhang, Qingfu
AU - Jin, Yaochu
AU - Sendhoff, Bernhard
PY - 2008
Y1 - 2008
N2 - The Pareto front (Pareto set) of a continuous optimization problem with m objectives is a (m-l) dimensional piecewise continuous manifold in the objective space (the decision space) under some mild conditions. Based on this regularity property in the objective space, we have recently developed several multiobjective estimation of distribution algorithms (EDAs). However, this property has not been utilized in the decision space. Using the regularity property in both the objective and decision space, this paper proposes a simple EDA for multiobjective optimization. Since the location information has not efficiently used in EDAs, a combination of EDA and differential evolution (DE) is suggested for improving the algorithmic performance. The hybrid method and the pure EDA method proposed in this paper, and a DE based method are compared on several test instances. Experimental results have shown that the algorithm with the proposed strategy is very promising.
AB - The Pareto front (Pareto set) of a continuous optimization problem with m objectives is a (m-l) dimensional piecewise continuous manifold in the objective space (the decision space) under some mild conditions. Based on this regularity property in the objective space, we have recently developed several multiobjective estimation of distribution algorithms (EDAs). However, this property has not been utilized in the decision space. Using the regularity property in both the objective and decision space, this paper proposes a simple EDA for multiobjective optimization. Since the location information has not efficiently used in EDAs, a combination of EDA and differential evolution (DE) is suggested for improving the algorithmic performance. The hybrid method and the pure EDA method proposed in this paper, and a DE based method are compared on several test instances. Experimental results have shown that the algorithm with the proposed strategy is very promising.
UR - https://www.scopus.com/pages/publications/55749093959
U2 - 10.1109/CEC.2008.4630984
DO - 10.1109/CEC.2008.4630984
M3 - 会议稿件
AN - SCOPUS:55749093959
SN - 9781424418237
T3 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008
SP - 1447
EP - 1454
BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008
T2 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008
Y2 - 1 June 2008 through 6 June 2008
ER -