Go to content
UR Home

Rapid Close-to-Optimum Optimization by Genetic Algorithms

Hackl, R. ; Morgenstern, Ingo


In this article we consider the optimization of np-complete problems with a genetic algorithm. For "real word" problems we regard it to be sufficient to get close to the optimal solution without any guarantee of ever hitting it. Our algorithm was tested on two problem classes: the traveling salesman problem and the product ordering problem; the first is a standard problem, the latter a problem we ...


Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons