Evolutionary algorithms: A critical review and its future prospects

  title={Evolutionary algorithms: A critical review and its future prospects},
  author={P. A. Vikhar},
  journal={2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC)},
  • P. Vikhar
  • Published 1 December 2016
  • Computer Science
  • 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC)
Evolutionary algorithm (EA) emerges as an important optimization and search technique in the last decade. [] Key Method It also includes unusual study of various invariants of EA like Genetic Programming (GP), Genetic Algorithm (GA), Evolutionary Programming (EP) and Evolution Strategies (ES). Extensions of EAs in the form of Memetic algorithms (MA) and distributed EA are also discussed. Further the paper focuses on various refinements done in area of EA to solve real life problems.

Figures from this paper

A Study on Evolutionary Algorithms and Its Applications
The population of possible solutions to the problem will be created first, and each solution will be evaluated using a 'fitness function', which develops over time and identifies the best solutions.
An Adaptive Multi-Population Optimization Algorithm for Global Continuous Optimization
The benchmark results show that the Adaptive Multi-Population Optimization (AMPO) achieves a better performance than those of nine state-of-the-art metaheuristics including the IEEE CEC winning algorithms, recent SI and multi-population/hybrid meta heuristics.
Evolutionary dataset optimisation: learning algorithm quality through evolution
A number of known properties about preferable datasets for the clustering algorithms known as k -means and DBSCAN are realised in the generated datasets.
A robust seasons algorithm to mitigate the search complexity of ES-PTS in finding phase weighting factors
The simulation results show that the proposed algorithm outperformed the existing optimization meta-heuristics in minimizing the envelop fluctuations and compared with several counterpart methods according to the fluctuation reduction performance and search cost.
Computation of Optimal Spacing and Density of Bus Rapid Transit Stations Using Evolutionary Algorithms
The computational experiments reveal that the optimal cost is substantially affected by the variations in the commuters’ demand, commuters' walking speed, and value of the users’ access and in-vehicle time.
Gaining-Sharing Knowledge Based Algorithm With Adaptive Parameters for Engineering Optimization
Modifications for the recently proposed Gaining-Sharing-Knowledge based algorithm (GSK) are presented for enhancing its performance and an adaptive scheme is presented to control the knowledge rate in order to simulate the gaining and sharing experience throughout the human being life span for a specific population by taking into consideration the diverse nature of any population.
Investigation of Optimization Algorithms for Neural Network Solutions of Optimal Control Problems with Mixed Constraints
This paper considers the problem of selecting the most efficient optimization algorithm for neural network approximation—solving optimal control problems with mixed constraints by applying the necessary optimality conditions, the Lagrange multiplier method and the least squares method.


Introduction to evolutionary algorithms
  • Xinjie Yu
  • Computer Science
    The 40th International Conference on Computers & Indutrial Engineering
  • 2010
Some interesting features of the new book “Introduction to Evolutionary Algorithms”, which is written by Xinjie Yu and Mitsuo Gen and be published by Springer in 2010, will be illustrated, including
Evolutionary programming made faster
A "fast EP" (FEP) is proposed which uses a Cauchy instead of Gaussian mutation as the primary search operator and is proposed and tested empirically, showing that IFEP performs better than or as well as the better of FEP and CEP for most benchmark problems tested.
Experimental optimization by evolutionary algorithms
This tutorial addresses applications of evolutionary algorithms to optimization tasks where the function evaluation cannot be done through a computer simulation, but requires the execution of an
Evolutionary Algorithm Definition
This study discussed the use of new evolutionary algorithm for automatic programming, based on theoretical definitions of program behaviors, which enhanced evolutionary process by simultaneously solving multi-parts from the same problem.
Comparison of multiobjective particle swarm optimization and evolutionary algorithms for optimal reactive power dispatch problem
The comparison results indicate that MOPSO generally outperforms other algorithms for ORPD and has a great potential in dealing with large-scale optimal power flow problems.
A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem
A theoretical investigation of three types of (N+1) evolutionary algorithms that exploit bitwise mutation, truncation selection, plus different repair methods for the 0-1 knapsack problem indicates that the solution produced by both pure strategy and mixed strategy evolutionary algorithms is arbitrarily bad.
A Primary Theoretical Study on Decomposition-Based Multiobjective Evolutionary Algorithms
The studies show that in certain cases, polynomialsized evenly distributed weight parameters-based decomposition cannot map each point in a polynomial sized Pareto front to a subproblem; an ideal serialized algorithm can be very efficient on some simple instances; the standard MOEA can benefit a runtime cut of a constant fraction from its neighborhood coevolution scheme.
Improved differential evolution algorithms
Two modified differential evolution are introduced by merging the mechanisms of quadratic approximation, Gaussian disturbing, immune theory and differential evolution to improve the searching ability of differential evolution.
An overview of evolutionary algorithms: practical issues and common pitfalls
Parallel Evolutionary Algorithms
  • Dirk Sudholt
  • Computer Science
    Handbook of Computational Intelligence
  • 2015
This paper focuses on island models, or coarse-grained EA s, which have shown that island models can speed up computation significantly, and that parallel populations can further increase solution diversity.