A heuristic algorithm based on Monte Carlo methods for the rural postman problem
Computers and Operations Research
Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Improvement Procedures for the Undirected Rural Postman Problem
INFORMS Journal on Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Rank-Based Ant System to Solve the Undirected Rural Postman Problem
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Artificial Ants and Packaging Waste Recycling
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.