A multi-agent based evolutionary algorithm in non-stationary environments

— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolve to find optimum. All agents live in a lattice like environment, where each agent is fixed on a lattice point. In order to increase the energy, agents can compete with their neighbors and can also acquire knowledge based on statistic information. In order to maintain the diversity of the population, the random immigrants and adaptive primal dual mapping schemes are used. Simulation experiments on a set of dynamic benchmark problems show that MAEA can obtain a better performance in non-stationary environments in comparison with several peer genetic algorithms.

• Type: Conference
• Year: 2008
• Where: CEC
• Authors: Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang Yang, Dazhi Wang
• Keywords: Artificial Intelligence, CEC 2008, Dynamic Benchmark Problems, Dynamic Optimization Problems, Primal Dual Mapping