Rapid Close-to-Optimum Optimization by Genetic Algorithms

R. Hackl () and I. Morgenstern ()
Additional contact information
R. Hackl: Institut für Physik II, Universität Regensburg, Universitätsstraβe 31, 93053 Regensburg, Germany
I. Morgenstern: Institut für Physik II, Universität Regensburg, Universitätsstraβe 31, 93053 Regensburg, Germany

International Journal of Modern Physics C (IJMPC), 1997, vol. 08, issue 05, 1103-1117

Abstract: 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 were confronted with in a practical application. For all investigated problem instances we found very good solutions(

Keywords: Optimization; Genetic Algorithms; Traveling Salesman; NP-Complete Problems (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183197000977
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:08:y:1997:i:05:n:s0129183197000977

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183197000977

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().