Solving the Traveling Salesman Problem Using Ant Colony Metaheuristic, A Review

    HIS, pp. 421-430, 2016.

    Cited by: 0|Bibtex|Views0|Links
    EI

    Abstract:

    This paper presents a software application allowing to solve and compare the key metaheuristic approaches for solving the Traveling Salesman Problem (TSP). The focus is based on Ant Colony Optimization (ACO) and its major hybridization schema. In this work, the hybridization ACO algorithm with local search approach and the impact of param...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments