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 ineff...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE Congress on Evolutionary Computation (CEC) pp. 2657 - 2663
Main Authors Nakano, Hidehiro, Kojima, Masataka, Miyauchi, Arata
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2015
Subjects
Algorithm design and analysis
Benchmark testing
Heuristic algorithms
Indexes
Optimization
Radiation detectors
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1089-778X
1941-0026
DOI:10.1109/CEC.2015.7257217