Title :
Ant Colony Optimization for solving the TSP symetric with parallel processing
Author :
Valdez, Fevrier ; Chaparro, Ivan
Author_Institution :
Div. of Grad. Studies, Tijuana Inst. of Technol., Tijuana, Mexico
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.
Keywords :
ant colony optimisation; computational geometry; mathematics computing; parallel processing; travelling salesman problems; ACO variants; ASrank; EAS; Euclidean distances; TSP symetric; ant colony optimization; elitist ant system; parallel processing; rank based ant system; symmetric travelling salesman problem; Ant colony optimization; Cities and towns; Conferences; MATLAB; Parallel processing; Runtime; Traveling salesman problems; Interface graphical; Parallel processing; TSP;
Conference_Titel :
IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), 2013 Joint
Conference_Location :
Edmonton, AB
DOI :
10.1109/IFSA-NAFIPS.2013.6608570
