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 …

Differential Evolution (DE) is a simple and efficient optimizer, especially for continuous
optimization. For these reasons DE has often been employed for solving various …

Evolutionary algorithms (EAs) are well-known optimization approaches to deal with
nonlinear and complex problems. However, these population-based algorithms are …

Particle swarm optimization (PSO) has been shown to yield good performance for solving
various optimization problems. However, it tends to suffer from premature convergence …

Although various population initialization techniques have been employed in evolutionary
algorithms (EAs), there lacks a comprehensive survey on this research topic. To fill this gap …

In this paper, an enhanced version of the opposition-based differential evolution (ODE) is
proposed. ODE utilizes opposite numbers in the population initialization and generation …

Differential evolution is a very popular optimization algorithm and considerable research has
been devoted to the development of efficient search operators. Motivated by the different …

For many soft computing methods, we need to generate random numbers to use either as
initial estimates or during the learning and search process. Recently, results for evolutionary …

Diverse forms of opposition are already existent virtually everywhere around us, and utilizing
opposite numbers to accelerate an optimization method is a new idea. Since 2005 …

Particle swarm optimization (PSO) has shown its fast search speed in many complicated
optimization and search problems. However, PSO could often easily fall into local optima …