e-space
Manchester Metropolitan University's Research Repository

    Vectorized Candidate Set Selection for Parallel Ant Colony Optimization

    Peake, J, Amos, M, Yiapanis, P and Lloyd, H (2018) Vectorized Candidate Set Selection for Parallel Ant Colony Optimization. In: Genetic and Evolutionary Computation Conference (GECCO '18), 15 July 2018 - 19 July 2018, Kyoto, Japan. (In Press)

    [img]
    Preview
    Published Version
    Download (1MB) | Preview

    Abstract

    Ant Colony Optimization (ACO) is a well-established nature-inspired heuristic, and parallel versions of the algorithm now exist to take advantage of emerging high-performance computing processors. However, careful attention must be paid to parallel components of such implementations if the full benefit of these platforms is to be obtained. One such component of the ACO algorithm is next node selection, which presents unique challenges in a parallel setting. In this paper, we present a new node selection method for ACO, Vectorized Candidate Set Selection (VCSS), which achieves significant speedup over existing selection methods on a test set of Traveling Salesman Problem instances.

    Impact and Reach

    Statistics

    Activity Overview
    6 month trend
    258Downloads
    6 month trend
    289Hits

    Additional statistics for this dataset are available via IRStats2.

    Altmetric

    Actions (login required)

    View Item View Item