Picture of DNA strand

Pioneering chemical biology & medicinal chemistry through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Pure & Applied Chemistry, based within the Faculty of Science.

Research here spans a wide range of topics from analytical chemistry to materials science, and from biological chemistry to theoretical chemistry. The specific work in chemical biology and medicinal chemistry, as an example, encompasses pioneering techniques in synthesis, bioinformatics, nucleic acid chemistry, amino acid chemistry, heterocyclic chemistry, biophysical chemistry and NMR spectroscopy.

Explore the Open Access research of the Department of Pure & Applied Chemistry. Or explore all of Strathclyde's Open Access research...

Multi-population inflationary differential evolution algorithm with adaptive local restart

Di Carlo, Marilena and Vasile, Massimiliano and Minisci, Edmondo (2015) Multi-population inflationary differential evolution algorithm with adaptive local restart. In: 2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings. Institute of Electrical and Electronics Engineers Inc., pp. 632-639. ISBN 9781479974924

[img]
Preview
Text (Di-Carlo-etal-CEC2015-Multi-population-inflationary-differential-evolution-algorithm-adaptive-local-restart)
Di_Carlo_etal_CEC2015_Multi_population_inflationary_differential_evolution_algorithm_adaptive_local_restart.pdf
Accepted Author Manuscript

Download (128kB)| Preview

    Abstract

    In this paper a Multi-Population Inflationary Differential Evolution algorithm with Adaptive Local Restart is presented and extensively tested over more than fifty test functions from the CEC 2005, CEC 2011 and CEC 2014 competitions. The algorithm combines a multi-population adaptive Differential Evolution with local search and local and global restart procedures. The proposed algorithm implements a simple but effective mechanism to avoid multiple detections of the same local minima. The novel mechanism allows the algorithm to decide whether to start or not a local search. The local restart of the population, which follows the local search, is, therefore, automatically adapted.