Loading...
Improved Ant Colony Optimization with Local Search for Traveling Salesman Problem
Author(s)
Oonsrikaw, Yindee
Date Issued
July 1, 2019
Type
Conference Paper
Abstract
Improved Ant Colony Optimization (IACO) with a local search algorithm is proposed for better finding near optimal solution of Traveling Salesman Problem (TSP). In this work, IACO was combined with each of four local search operators in order to enhance IACO exploration capacity. The performances of IACO and the four local search were comparatively tested on a set of benchmark symmetric TSP instances. The experimental results show that IACO.
Citation
Proceedings 20th IEEE Acis International Conference on Software Engineering Artificial Intelligence Networking and Parallel Distributed Computing Snpd 2019, 22-27, 2019