TY - GEN
T1 - Scale adaptive reproduction operator for decomposition based estimation of distribution algorithm
AU - Wang, Bo
AU - Xu, Hua
AU - Yuan, Yuan
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/10
Y1 - 2015/9/10
N2 - Multi-objective evolutionary algorithm based on decomposition (MOEA/D) uses crossover operator which often either breaks the building blocks or mix them ineffectively. Multi-objective estimation of distribution algorithm based on decomposition (MEDA/D) evolves a probability vector for each sub-problem to guide the search instead of using crossover operator.However, since the number of the weight vectors in the neighborhood of each weight vector is relatively small and MEDA/D does not provide a way to maintain diversity, the performance of MEDA/D is limited. To overcome the drawbacks of MEDA/D, we proposed a new reproduction operator. This operator could promote diversity. We introduced it into MOEA/D framework and the new algorithm is called s-MEDA/D. We also prove that the parameter newly introduced has physical significance and the reproduction operator is not susceptible to the scale of the problem. The s-MEDA/D was tested on nine instances of the 0/1 multi-objective knapsack problem. Empirical evaluation suggests that the proposed algorithm is effective and efficient.
AB - Multi-objective evolutionary algorithm based on decomposition (MOEA/D) uses crossover operator which often either breaks the building blocks or mix them ineffectively. Multi-objective estimation of distribution algorithm based on decomposition (MEDA/D) evolves a probability vector for each sub-problem to guide the search instead of using crossover operator.However, since the number of the weight vectors in the neighborhood of each weight vector is relatively small and MEDA/D does not provide a way to maintain diversity, the performance of MEDA/D is limited. To overcome the drawbacks of MEDA/D, we proposed a new reproduction operator. This operator could promote diversity. We introduced it into MOEA/D framework and the new algorithm is called s-MEDA/D. We also prove that the parameter newly introduced has physical significance and the reproduction operator is not susceptible to the scale of the problem. The s-MEDA/D was tested on nine instances of the 0/1 multi-objective knapsack problem. Empirical evaluation suggests that the proposed algorithm is effective and efficient.
UR - http://www.scopus.com/inward/record.url?scp=84963537703&partnerID=8YFLogxK
U2 - 10.1109/CEC.2015.7257136
DO - 10.1109/CEC.2015.7257136
M3 - 会议稿件
AN - SCOPUS:84963537703
T3 - 2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings
SP - 2042
EP - 2049
BT - 2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE Congress on Evolutionary Computation, CEC 2015
Y2 - 25 May 2015 through 28 May 2015
ER -