Comparison among five evolutionary-based optimization algorithms

  • Authors:

  • Emad Elbeltagi;Tarek Hegazy;Donald Grierson

  • Affiliations:

  • Department of Structural Engineering, Faculty of Engineering, Mansoura University, Mansoura 35516, Egypt;Department of Civil Engineering, University of Waterloo, Waterloo, Ont., Canada N2L 3G1;Department of Civil Engineering, University of Waterloo, Waterloo, Ont., Canada N2L 3G1

  • Venue:
  • Advanced Engineering Informatics
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed to arrive at near-optimum solutions to large-scale optimization problems, for which traditional mathematical techniques may fail. This paper compares the formulation and results of five recent evolutionary-based algorithms: genetic algorithms, memetic algorithms, particle swarm, ant-colony systems, and shuffled frog leaping. A brief description of each algorithm is presented along with a pseudocode to facilitate the implementation and use of such algorithms by researchers and practitioners. Benchmark comparisons among the algorithms are presented for both continuous and discrete optimization problems, in terms of processing time, convergence speed, and quality of the results. Based on this comparative analysis, the performance of EAs is discussed along with some guidelines for determining the best operators for each algorithm. The study presents sophisticated ideas in a simplified form that should be beneficial to both practitioners and researchers involved in solving optimization problems.