抄録
Although ABC (artificial bee colony) algorithm is effective tool for finding solutions to static optimization problems, application to the dynamical problem which includes the time-varying element has been not assumed. A modification of ABC algorithm for adaptation to time-varying functions is proposed. To adjust to the change in the function, the procedure for reevaluating the bee at each time is introduced. It is shown that the proposed modification does not influence the search performance of the conventional algorithm. The efficiency of the modified ABC algorithm is demonstrated and verified by numerical simulations.
