Go to content
UR Home

Rapid Close-to-Optimum Optimization by Genetic Algorithms

Hackl, R. and Morgenstern, Ingo (1997) Rapid Close-to-Optimum Optimization by Genetic Algorithms. International Journal of Modern Physics C (ijmpc) 8 (5), pp. 1103-1117.

Full text not available from this repository.

at publisher (via DOI)


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 ...


Export bibliographical data

Item type:Article
Date:October 1997
Institutions:Physics > Institute of Theroretical Physics > Professor Morgenstern
Identification Number:
Keywords:Optimization; Genetic Algorithms; Traveling Salesman; NP-Complete Problems
Dewey Decimal Classification:500 Science > 530 Physics
Created at the University of Regensburg:Unknown
Item ID:16262
Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons