Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
An Ant Colony Optimization and Bayesian Network Structure Application for the Asymmetric Traveling Salesman Problem
verfasst von : Nai-Hua Chen
Erschienen in: Intelligent Information and Database Systems
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 asymmetric traveling salesman problem (ATSP) is an NP-hard problem. The Bayesian network structure which describes conditional independence among subsets of variables is useful in reasoning uncertainty. The ATSP is formed as the Bayesian network structure and solved by the ant colony optimization (ACO) in this study. The proposed algorithm is tested in different sample size. The exam case is finding customer preference’s city sequence. Results show the proposed algorithm has a higher joint probability than random selected case. More applications such as the sequential decision, the variable ordering or the route planning can also implement.