1998 | OriginalPaper | Buchkapitel
Breeding Perturbed City Coordinates and Fooling Travelling Salesman Heuristic Algorithms
verfasst von : R. Bradwell, L. P. Williams, C. L. Valenzuela
Erschienen in: Artificial Neural Nets and Genetic Algorithms
Verlag: Springer Vienna
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Standard heuristic algorithms for the geometric travelling salesman problem (GTSP) frequently produce poor solutions in excess of 25% above the true optimum. In this paper we present some preliminary work that demonstrates the potential of genetic algorithms (GAs) to perturb city coordinates in such a way that the heuristic is ‘fooled’ into producing much better solutions to the GTSP. Initial results for our GA show that by using the nearest neighbour tour construction heuristic on perturbed coordinate sets it is possible to consistently obtain solutions to within a fraction of a percent of the optimum for problems of several hundred cities.