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

Evolutionary Algorithms: A Critical Review and its Future Prospects

A critical overview of Evolutionary algorithms is presented and unusual study of various invariants of EA like Genetic Algorithm, Genetic Programming, Evolution Strategies,Evolution Strategies and Evolutionary Programming are discussed.

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.

Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis

A global sensitivity analysis framework is described that enables a better understanding of the effects of parameters on algorithm performance, and can be adopted to evaluate the importance of the parameters of any algorithm.

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.



Generalized theory for hybridization of evolutionary algorithms

Simulations for a series of benchmark test functions justify that an adroit hybridization of various evolutionary algorithms could yield a robust and efficient means of solving wide range of global optimization problems than the standalone evolutionary algorithms.

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.

Introduction to evolutionary algorithms

Evolutionary Algorithms are an approved set of heuristics, which are flexible to use and postulate only neglectible requirements on the optimisation task.

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 Introduction to Evolutionary Algorithms and Their Applications

This paper provides a brief introduction to evolutionary algorithms including some of their applications and some of the current research directions in this area are provided.