The merits of a parallel genetic algorithm in solving hard optimization problems.

Abstract

A parallel genetic algorithm for optimization is outlined, and its performance on both mathematical and biomechanical optimization problems is compared to a sequential quadratic programming algorithm, a downhill simplex algorithm and a simulated annealing algorithm. When high-dimensional non-smooth or discontinuous problems with numerous local optima are… (More)

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.