Regresar

Improving ant colony optimization to solve the travelling salesman problem

Abstract:

In this paper we propose an improvement of Ant Colony Optimization to solve the Travelling Salesman Problem. In this case, we use the Ant Colony System algorithm. The basic idea is to split the heuristic search performed by ants into two stages. That is, a multilevel approach is used. Also, the effect of using local search was analyzed. Experimental results obtained show this new approach significantly improves the Ant Colony System in terms of the computation time needed.

Año de publicación:

2006

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Algoritmo
    • Algoritmo
    • Algoritmo

    Áreas temáticas:

    • Ciencias de la computación

    Contribuidores:

    Martínez Y.Martínez Y.
    Amilkar PurisAmilkar Puris
    Nowé A.Nowé A.
    Bello R.R.Bello R.R.