Self-adaptive differential evolution with multi-trajectory search for large-scale optimization

Authors:
Shi-Zheng Zhao;Ponnuthurai Nagaratnam Suganthan;Swagatam Das
Affiliations:
Nanyang Technological University, School of Electrical and Electronic Engineering, 50 Nanyang Ave., 639798, Singapore, Singapore;Nanyang Technological University, School of Electrical and Electronic Engineering, 50 Nanyang Ave., 639798, Singapore, Singapore;Jadavpur University, Department of Electronics and Telecommunication, Kolkata, India
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
Year:
2011

Citing 0
Cited 11

Evolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution: A hybrid approach

Information Sciences: an International Journal
Differential evolution-based nonlinear system modeling using a bilinear series model

Applied Soft Computing
DESAMC+DocSum: Differential evolution with self-adaptive mutation and crossover parameters for multi-document summarization

Knowledge-Based Systems
Parallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems

Journal of Parallel and Distributed Computing
Differential evolution algorithm: recent advances

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Cooperative co-evolutionary teaching-learning based algorithm with a modified exploration strategy for large scale global optimization

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Large scale optimization based on co-ordinated bacterial dynamics and opposite numbers

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Adaptive Memetic Differential Evolution with Global and Local neighborhood-based mutation operators

Information Sciences: an International Journal
Parameter-less algorithm for evolutionary-based optimization

Computational Optimization and Applications
On the equivalences and differences of evolutionary algorithms

Engineering Applications of Artificial Intelligence
Repairing the crossover rate in adaptive differential evolution

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, self-adaptive differential evolution (DE) is enhanced by incorporating the JADE mutation strategy and hybridized with modified multi-trajectory search (MMTS) algorithm (SaDE-MMTS) to solve large-scale continuous optimization problems. The JADE mutation strategy, the “DE/current-to-pbest” which is a variation of the classic “DE/current-to-best”, is used for generating mutant vectors. After the mutation phase, the binomial (uniform) crossover, the exponential crossover as well as no crossover option are used to generate each pair of target and trial vectors. By utilizing the self-adaptation in SaDE, both trial vector generation strategies and their associated control parameter values are gradually self-adapted by learning from their previous experiences in generating promising solutions. Consequently, suitable offspring generation strategy along with associated parameter settings will be determined adaptively to match different phases of the search process. MMTS is applied frequently to refine several diversely distributed solutions at different search stages satisfying both the global and the local search requirement. The initialization of step sizes is also defined by a self-adaption during every MMTS step. The success rates of both SaDE and the MMTS are determined and compared; consequently, future function evaluations for both search algorithms are assigned proportionally to their recent past performance. The proposed SaDE-MMTS is employed to solve the 19 numerical optimization problems in special issue of soft computing on scalability of evolutionary algorithms for large-scale continuous optimization problems and competitive results are presented.