Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Journal of Computer and System Sciences
Theoretical Computer Science - Natural computing
The differential ant-stigmergy algorithm applied to dynamic optimization problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Evolutionary swarm cooperative optimization in dynamic environments
Natural Computing: an international journal
IEEE Transactions on Evolutionary Computation
Particle swarm optimization with composite particles in dynamic environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A T-cell algorithm for solving dynamic optimization problems
Information Sciences: an International Journal
Optimization in dynamic environments: a survey on problems, methods and measures
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Multiswarms, exclusion, and anti-convergence in dynamic environments
IEEE Transactions on Evolutionary Computation
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems
International Journal of Systems Science - Computational intelligence optimisation in the presence of uncertainties
Differential evolution and differential ant-stigmergy on dynamic optimisation problems
International Journal of Systems Science
Hi-index | 0.00 |
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.