Sciweavers

PPSN
1994
Springer

An Evolutionary Algorithm for Integer Programming

14 years 3 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings in genetic algorithms or normal distributions for real valued vectors in evolution strategies and evolutionary programming. This paper is devoted to the construction of a mutation distribution for unbounded integer search spaces. The principle of maximum entropy is used to select a speci c distribution from numerous potential candidates. The resulting evolutionary algorithm is tested for ve nonlinear integer problems.
Günter Rudolph
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1994
Where PPSN
Authors Günter Rudolph
Comments (0)