Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Three-Tier Multi-agent Approach for Solving Traveling Salesman Problem
verfasst von : Shi-Liang Yan, Ke-Feng Zhou
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
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-hard, and is an often-used benchmark for new optimization techniques.This paper will to bring up a three-tier multi-agent approach for solving the TSP. This proposed approach supports the distributed solving to the TSP. It divides into three-tier (layer), the first tier is ant colony optimization agent and its function is generating the new solution continuously; the second-tier is genetic algorithm agent, its function is optimizing the current solutions group; and the third tier is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. Ultimately, the experimental results have shown that the proposed hybrid approach has good performance with respect to the quality of solution and the speed of computation.