An informative differential evolution with self adaptive re-clustering technique

Authors:
Dipankar Maity;Udit Halder;Preetam Dasgupta
Affiliations:
Dept. of Electronics and Tele-communication Engineering, Jadavpur University, Kolkata, India;Dept. of Electronics and Tele-communication Engineering, Jadavpur University, Kolkata, India;Dept. of Electronics and Tele-communication Engineering, Jadavpur University, Kolkata, India
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 8
Cited 1

The immune system, adaptation, and machine learning

Physica D
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Differential Evolution Training Algorithm for Feed-Forward Neural Networks

Neural Processing Letters
Ant Colony Optimization

Ant Colony Optimization
Differential evolution algorithm with strategy adaptation for global numerical optimization

IEEE Transactions on Evolutionary Computation
Differential evolution using a neighborhood-based mutation operator

IEEE Transactions on Evolutionary Computation
Differential evolution algorithm with ensemble of parameters and mutation strategies

Applied Soft Computing
Differential Evolution: A Survey of the State-of-the-Art

IEEE Transactions on Evolutionary Computation

Performance of informative differential evolution algorithm with self adaptive re-clustering technique on the problems of electromagnetism: the linear array antenna synthesis

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an informative Differential Evolution (DE) algorithm where the information gained by the individuals of a cluster will be exchanged after a certain number of iterations called refreshing gap. The DE is empowered with a clustering technique to improve its efficiency over multimodal landscapes. During evolution, self-adaptive behaviour helps in re-clustering. With the better explorative power of the proposed algorithm we have used a new local search technique for fine tuning near a suspected optimal position. The performance of the proposed algorithm is evaluated over 25 benchmark functions and compared with existing algorithms.