An artificial bee colony algorithm with a memory scheme for dynamic optimization problems

In Dynamic Optimization Problems (DOPs), the characteristics of the problems change dynamically due to various kinds of factors. In these problems, basic optimization algorithms decrease the searching performances, because the effective solutions obtained in the past search process change into ineffective ones. For high-order dimensional DOPs, we have proposed an Improved ABC (IABC) algorithm. In this paper, the IABC algorithm is farther modified in order to develop the searching performances for DOPs. In the proposed algorithm, basically, two schemes are added to the conventional IABC: a simple memory scheme and a simple detection scheme for dynamic changes. By performing the numerical experiments, the effectiveness of the proposed algorithm is confirmed.