TY - JOUR

T1 - Accelerating evolutionary computation using a convergence point estimated by weighted moving vectors

AU - Yu, Jun

AU - Li, Yuhao

AU - Pei, Yan

AU - Takagi, Hideyuki

N1 - Funding Information:
This work was supported in part by Grant-in-Aid for Scientific Research (17H06197, 18K11470, 19J11792).
Publisher Copyright:
© 2019, The Author(s).

PY - 2020/4

Y1 - 2020/4

N2 - We introduce weighted moving vectors to increase the accuracy of estimating a convergence point of population and evaluate its efficiency. Key point is to weight moving vectors according to their reliability when a convergence point is calculated instead of equal weighting of the original method. We propose two different methods to evaluate the reliability of moving vectors. The first approach uses the fitness gradient information between starting points and terminal points of moving vectors for their weights. When a fitness gradient is bigger, the direction of a moving vector may have more potential, and a higher weight is given to it. The second one uses the fitness of parents, i.e., starting points of moving vectors, to give weights for moving vectors. Because an individual with higher fitness may have a high probability of being close to the optimal area, it should be given a higher weight, vice versa. If the estimated point is better than the worst individual in current population, it is used as an elite individual and replace the worst one to accelerate the convergence of evolutionary algorithms. To evaluate the performance of our proposal, we employ differential evolution and particle swarm optimization as baseline algorithms in our evaluation experiments and run them on 28 benchmark functions from CEC 2013. The experimental results confirmed that introducing weights can further improve the accuracy of an estimated convergence point, which helps to make EC search faster. Finally, some open topics are given to discuss.

AB - We introduce weighted moving vectors to increase the accuracy of estimating a convergence point of population and evaluate its efficiency. Key point is to weight moving vectors according to their reliability when a convergence point is calculated instead of equal weighting of the original method. We propose two different methods to evaluate the reliability of moving vectors. The first approach uses the fitness gradient information between starting points and terminal points of moving vectors for their weights. When a fitness gradient is bigger, the direction of a moving vector may have more potential, and a higher weight is given to it. The second one uses the fitness of parents, i.e., starting points of moving vectors, to give weights for moving vectors. Because an individual with higher fitness may have a high probability of being close to the optimal area, it should be given a higher weight, vice versa. If the estimated point is better than the worst individual in current population, it is used as an elite individual and replace the worst one to accelerate the convergence of evolutionary algorithms. To evaluate the performance of our proposal, we employ differential evolution and particle swarm optimization as baseline algorithms in our evaluation experiments and run them on 28 benchmark functions from CEC 2013. The experimental results confirmed that introducing weights can further improve the accuracy of an estimated convergence point, which helps to make EC search faster. Finally, some open topics are given to discuss.

UR - http://www.scopus.com/inward/record.url?scp=85099709262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85099709262&partnerID=8YFLogxK

U2 - 10.1007/s40747-019-0111-6

DO - 10.1007/s40747-019-0111-6

M3 - Article

AN - SCOPUS:85099709262

SN - 2199-4536

VL - 6

SP - 55

EP - 65

JO - Complex and Intelligent Systems

JF - Complex and Intelligent Systems

IS - 1

ER -