A New Ant Supervised-PSO Variant Applied to Traveling Salesman Problem

    HIS, pp. 87-101, 2015.

    Cited by: 9|Bibtex|Views0|Links
    EI

    Abstract:

    The Traveling Salesman Problem (TSP) is one of the standard test problems often used for benchmarking of discrete optimization algorithms. Several meta-heuristic methods, including ant colony optimization (ACO), particle swarm optimization (PSO), bat algorithm, and others, were applied to the TSP in the past. Hybrid methods are generally ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments