Startseite UB

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)


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

plus


Export bibliographical data

Item Type:Article
Date:October 1997
Institutions:Physics > Institute of Theroretical Physics > Professor Morgenstern
Identification Number:
ValueType
10.1142/S0129183197000977DOI
Keywords:Optimization; Genetic Algorithms; Traveling Salesman; NP-Complete Problems
Subjects:500 Science > 530 Physics
Status:Published
Refereed:Unknown
Created at the University of Regensburg:Unknown
Owner: Martin Kaiser
Deposited On:23 Aug 2010 11:55
Last Modified:23 Aug 2010 11:55
Item ID:16262
Owner Only: item control page
  1. University

University Library

Publication Server

Contact person
Gernot Deinzer

Telefon 0941 943-2759
Contact