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 ...
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 (<0.2% above optimum) in each run and even the global optimum in some runs on a Pentium/100 MHz-PC. For one instance of the TSP problem we could verify that the time spent to find the optimum follows a logarithmic normal distribution.
Altmetric