Abstract
The objective of this work is to apply artificial ant colonies to solve the Rural Postman Problem on undirected graphs. In order to do so, we will transform this problem into a Traveling Salesman Problem, applying to this new problem algorithms based on artificial ant colonies, which have been applied at great length to the same, obtaining good results. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Pérez-Delgado, M. L. (2007). A solution to the rural postman problem based on artificial ant colonies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4788 LNAI, pp. 220–228). Springer Verlag. https://doi.org/10.1007/978-3-540-75271-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
