A solution to the rural postman problem based on artificial ant colonies

  1. Pérez Delgado, M. L. 1
  1. 1 Universidad de Salamanca
    info

    Universidad de Salamanca

    Salamanca, España

    ROR https://ror.org/02f40zc51

Livre:
XII Conferencia de la Asociación Española para la Inteligencia Artificial: (CAEPIA 2007). Actas
  1. Borrajo Millán, Daniel (coord.)
  2. Castillo Vidal, Luis (coord.)
  3. Corchado Rodríguez, Juan Manuel (coord.)

Éditorial: Universidad de Salamanca

ISBN: 978-84-611-8846-8 978-84-611-8847-5

Année de publication: 2007

Volumen: 1

Pages: 197-206

Congreso: Conferencia de la Asociación Española para la Inteligencia Artificial (12. 2007. Salamanca)

Type: Communication dans un congrès

Résumé

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 lenght to the same, obtaining good results.