Differential Evolution: A survey of theoretical analyses

KR Opara, J Arabas - Swarm and evolutionary computation, 2019 - Elsevier
Differential Evolution (DE) is a state-of-the art global optimization technique. Considerable
research effort has been made to improve this algorithm and apply it to a variety of practical …

A survey on nature inspired metaheuristic algorithms for partitional clustering

SJ Nanda, G Panda - Swarm and Evolutionary computation, 2014 - Elsevier
The partitional clustering concept started with K-means algorithm which was published in
1957. Since then many classical partitional clustering algorithms have been reported based …

Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis

F Herrera, M Lozano, JL Verdegay - Artificial intelligence review, 1998 - Springer
Genetic algorithms play a significant role, as search techniques forhandling complex
spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic …

Metaheuristics: A bibliography

IH Osman, G Laporte - Annals of Operations research, 1996 - Springer
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

[图书][B] Neural networks: an introduction

B Müller, J Reinhardt, MT Strickland - 2012 - books.google.com
Neural Networks presents concepts of neural-network models and techniques of parallel
distributed processing in a three-step approach:-A brief overview of the neural structure of …

Evolutionary optimization as applied to inverse scattering problems

P Rocca, M Benedetti, M Donelli… - Inverse …, 2009 - iopscience.iop.org
This review is aimed at presenting an overview of evolutionary algorithms (EAs) as applied
to the solution of inverse scattering problems. The focus of this work is on the use of different …

In search of optimal clusters using genetic algorithms

CA Murthy, N Chowdhury - Pattern Recognition Letters, 1996 - Elsevier
Genetic Algorithms (GAs) are generally portrayed as search procedures which can optimize
functions based on a limited sample of function values. In this paper, GAs have been used in …

Convergence analysis and improvements of quantum-behaved particle swarm optimization

J Sun, X Wu, V Palade, W Fang, CH Lai, W Xu - Information Sciences, 2012 - Elsevier
Motivated by concepts in quantum mechanics and particle swarm optimization (PSO),
quantum-behaved particle swarm optimization (QPSO) was proposed as a variant of PSO …

[图书][B] Particle swarm optimisation: classical and quantum perspectives

J Sun, CH Lai, XJ Wu - 2016 - books.google.com
Although the particle swarm optimisation (PSO) algorithm requires relatively few parameters
and is computationally simple and easy to implement, it is not a globally convergent …

On the convergence of a class of estimation of distribution algorithms

Q Zhang, H Muhlenbein - IEEE Transactions on evolutionary …, 2004 - ieeexplore.ieee.org
We investigate the global convergence of estimation of distribution algorithms (EDAs). In
EDAs, the distribution is estimated from a set of selected elements, ie, the parent set, and …