Regresar

Two-stage ant colony optimization for solving the traveling salesman problem

Abstract:

In this paper, a multilevel approach of Ant Colony Optimization to solve the Traveling Salesman Problem is introduced. The basic idea is to split the heuristic search performed by ants into two stages; in this case we use both the Ant System and Ant Colony System algorithms. Also, the effect of using local search was analyzed. We have studied the performance of this new algorithm for several Traveling Salesman Problem instances. Experimental results obtained conclude that the Two-Stage approach significantly improves the Ant System and Ant Colony System in terms of the computation time needed. © Springer-Verlag Berlin Heidelberg 2007.

Año de publicación:

2007

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.