Comparison among five evolutionary-based optimization algorithms

Emad Elbeltagi

doi:10.1016/j.aei.2005.01.004

Return

Comparison among five evolutionary-based optimization algorithms

2005-01-01

1.0K

PRE

Emad Elbeltagi

Tarek Hegazy

DOI：10.1016/j.aei.2005.01.004

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2005 Elsevier Ltd. All rights reserved.

Keywords:

evolutionary algorithms

genetic algorithms

memetic algorithms

particle swarm

ant colony

shuffled frog leaping

optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.