Hits:

Indexed by:会议论文

Date of Publication:2013-04-03

Included Journals:EI、CPCI-S、Scopus

Volume:7832

Page Number:145-156

Key Words:dynamic evolutionary membrane algorithm; membrane computing; diversity; dynamic optimization problem

Abstract:Several problems that we face in real word are dynamic in nature. For solving these problems, a novel dynamic evolutionary algorithm based on membrane computing is proposed. In this paper, the partitioning strategy is employed to divide the search space to improve the search efficiency of the algorithm. Furthermore, the four kinds of evolutionary rules are introduced to maintain the diversity of solutions found by the proposed algorithm. The performance of the proposed algorithm has been evaluated over the standard moving peaks benchmark. The simulation results indicate that the proposed algorithm is feasible and effective for solving dynamic optimization problems.