2013•Unpublished venueRequires access

Ant Colony Optimization for solving the TSP symetric with parallel processing

Fevrier Valdez, Iván Chaparro

Abstract

This paper describes the symmetric travelling salesman problem (TSP) with 22 and 1060 cities with Euclidean distances and its solution with different ACO variants using parallel processing. We implemented the algorithms Elitist Ant System (EAS) and Rank Based Ant System (ASrank) with parallel processing to find optimal results for TSP.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Travelling salesman problem, Ant colony optimization algorithms, Computer science, Parallel processing, Ant colony, Euclidean geometry, Euclidean distance, ANT