Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Rank-Based Ant System to Solve the Undirected Rural Postman Problem
verfasst von : María Luisa Pérez-Delgado
Erschienen in: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
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
Ant-based algorithms constitute a metaheuristic successfully applied to solve combinatorial optimization problems. This paper presents the computational results of the application of an ants-algorithm, called the Rank-Based Ant System, to solve the Undirected Rural Postman Problem. Because this is a NP-hard problem, several approximate methods have been proposed to solve it. The results reported in this paper improve some of the ones reached by other approximate methods applied to the problem.