GENETINIAI ALGORITMAI KOMIVOJAŽIERIAUS UŽDAVINIUI: NEGATYVIEJI IR POZITYVIEJI ASPEKTAI*
ON THE GENETIC ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM: NEGATIVE AND POSITIVE ASPECTS

Summary/Abstract: In this paper, we discuss some issues related to the application of genetic algorithms (GAs) to the well-known combinatorial optimization problem – the traveling salesman problem (TSP). The results obtained from the experiments with the different variants of the genetic algorithm are presented as well. Based on these results, it is concluded that the effi ciency of the genetic search is much infl uenced by both the specifi c nature of the problem and the features of the algorithm itself. In particular, it should be emphasized that the incorporation of the (postcrossover) procedures for the local improvement of offspring has one of the crucial roles in obtaining high-quality solutions.

• Details
• Contents