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. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Pérez-Delgado, M. L. (2009). Rank-based ant system to solve the undirected rural postman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5518 LNCS, pp. 507–514). https://doi.org/10.1007/978-3-642-02481-8_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
