Rank-Based Ant System to Solve the Undirected Rural Postman Problem

Authors:
María Luisa Pérez-Delgado
Affiliations:
Escuela Politécnica Superior de Zamora, Universidad de Salamanca, Zamora, Spain C.P. 49022
Venue:
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
Year:
2009

Citing 10
Cited 0

Algorithms for the rural postman problem

Computers and Operations Research
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)
Improvement Procedures for the Undirected Rural Postman Problem

INFORMS Journal on Computing
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

Operations Research
Ant Colony Optimization

Ant Colony Optimization
A constructive heuristic for the undirected rural postman problem

Computers and Operations Research
A Solution to the Rural Postman Problem Based on Artificial Ant Colonies

Current Topics in Artificial Intelligence
Self-organizing feature maps to solve the undirected rural postman problem

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.