A Solution to the Rural Postman Problem Based on Artificial Ant Colonies

摘要

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.