Routing Problems arise in several areas of distribution management and logistics and their practical significance is widely known. These problems are usually difficult to solve. Therefore, heuristic methods are applied to try to solve them. This paper describes the application of artificial ant colonies to solve the General Routing Problem. For this, the problem is first transformed into a node-routing problem. The transformed problem is solved by applying an ant-based algorithm which has been widely applied to node-routing problems, obtaining good results. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Pérez-Delgado, M. L. (2010). Solving the general routing problem by artificial ants. In Advances in Intelligent and Soft Computing (Vol. 79, pp. 637–644). https://doi.org/10.1007/978-3-642-14883-5_81
Mendeley helps you to discover research relevant for your work.