2006 | OriginalPaper | Buchkapitel
The Optimal Solution of TSP Using the New Mixture Initialization and Sequential Transformation Method in Genetic Algorithm
verfasst von : Rae-Goo Kang, Chai-Yeoung Jung
Erschienen in: PRICAI 2006: Trends in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
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
TSP is a problem finding out the shortest distance out of possible courses where one starts a certain city and turns back to a starting city, visiting every city only once among
N
cities. This paper proposes the new method using both population initialization and sequential transformation method at the same time and then proves the improvement of capability by comparing them with existing methods.