An Evolutionary Algorithm for Integer Programming

  title={An Evolutionary Algorithm for Integer Programming},
  author={G{\"u}nter Rudolph},
  • G. Rudolph
  • Published in PPSN 9 October 1994
  • Mathematics, Computer Science
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 specific distribution from numerous potential… 
Integer Encoding Differential Evolution Algorithm for Integer Programming
Several initial simulation results show the novel integer encoding Differential Evolution algorithm is effective and efficient in solving the integer optimization problems.
Differential evolution for integer programming problems
The results show that the SDE seems to be an efficient alternative for solving integer programming problems and not the standard DE and particle swarm optimization methods.
An evolutionary solver for linear integer programming
The performance of the evolutionary algorithm is promising; good feasible solutions were generally obtained, and in some of the difficult benchmark tests it outperformed branch-and-bound.
Mixed Integer Evolution Strategies for Parameter Optimization
MIES can deal with parameter vectors consisting not only of continuous variables but also with nominal discrete and integer variables and it is shown that with proper constraint handling techniques, MIES can also be applied to classical mixed integer nonlinear programming problems.
A Grid-based Genetic Algorithm for Multimodal Real Function Optimization
A novel genetic algorithm called GGA (Grid-based Genetic Algorithm) is presented to improve the optimization of multimodal real functions, making the search process more efficient and faster.
Mutation Operators for the Evolution of Finite Automata
Variation operators based on the automatons input/output behavior rather than its structure are introduced to make use of additional information based on a ranking of states as well as a problem-speci c metric which enhances the search process.
Mutation Operators for the Evolution of Finite Automata
Variation operators based on the automatons input/output behavior rather than its structure are introduced to make use of additional information based on a ranking of states as well as a problem-speciic metric which enhances the search process.
On Representation and Genetic Operators in Evolutionary Algorithms
The representation problem is formalized and a package of requirements to guide the design of genetic operators is proposed, which can be used to design a genetic programming (GP) system for Boolean functions.
Particle swarm optimization for integer programming
Three variants of PSO are compared with the widely used branch and bound technique, on several integer programming test problems and results indicate that PSO handles efficiently such problems, and in most cases it outperforms the branch and Bound technique.
Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm
This paper presents a study that applies the Artificial Bee Colony algorithm to integer programming problems and compares its performance with those of Particle Swarm Optimization algorithm variants


Genetic Algorithms in Search Optimization and Machine Learning
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
An Overview of Evolutionary Algorithms for Parameter Optimization
Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs),
Optimization of System Reliability by a New Nonlinear Integer Programming Procedure
  • R. Luus
  • Computer Science
    IEEE Transactions on Reliability
  • 1975
The effectiveness of the method is shown with a 15-variable problem, which requires about 1 day's FORTRAN programming effort and 8 seconds of computer time for its solution on an IBM 370/165 digital computer.
The success of these new methods in finding good solutions in penalty function problems indicates their usefulness in solving unconstrained nonlinear discrete variable optimization problems.
Adaptation in natural and artificial systems
Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Symmetric Multivariate and Related Distributions
Part 1 Preliminaries: construction of symmetric multivariate distributions notation of algebraic entities and characteristics of random quantities the "d" operator groups and invariance dirichlet