Selšuk Journal of Applied Mathematics

www.selcuk.edu.tr




 Selšuk Journal of
  Applied Mathematics

  Summer-Autumn, 2002
  Volume  3
  Number 2

 
Research Center of 
  Applied Mathematics


 SJAM Summer-Autumn 2002, Volume 3 - Number 2

Efficient strategies for optimization with genetic algorithms

Hans- Joachim  Bungartz, Igor Trajkovski

Institute of Paralel and Distributed Systems, University of Stuttgart,
Breitwiesenstr. 20-22, D 70565 Stuttgart, Germany
   email : bungartz@informatik.uni-stuttgart.de ;
   email: trajkoig@informatik.uni-stuttgart.de

Received: November 9, 2002
 

Summary
Evolutionary strategies in general and genetic algorithms in particular have turned out to be of increasing relevance for various classes of optimization problems like combinatory problems as a discrete example or shape optimization as a continuous example. In this paper, we present efficient and powerful strategies for genetic algorithms and their application to two classes of optimization problems. Besides algorithmic aspects concerning the genetic essentials, the focus is put on the efficient implementation, both of the sequential and of the parallel versions.

 

Key words
optimization, genetic algorithms, parallel algorithms.
 

2000 Mathematics Subject Classification : 68W10, 90C27, 68R05
 

 Article in PS format (1.99 Mb)  Article in ZIP format (111 Kb)

The article is
available to read in 
Ghostview format


[Home] [contact]