scholarly journals Improved Ant Colony System for the Traveling Salesman Problem

2005 ◽  
Vol 12B (7) ◽  
pp. 823-828 ◽  
Author(s):  
In-Kyeom Kim ◽  
Min-Young Yun
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony System ◽  
The Traveling Salesman Problem

An Improved Ant Colony System Based on Negative Biased

2010 ◽  
Vol 439-440 ◽  
pp. 558-562
Author(s):  
Jin Qiu Yang ◽  
Jian Gang Yang ◽  
Gen Lang Chen
Keyword(s):  
Convergence Rate ◽  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony System ◽  
Ant System

Ant System (AS) was the first Ant Colony Optimization (ACO) algorithm, which converged too slowly and consumed huge computation. Among the variants of AS, Ant Colony System (ACS) was one of the most successful algorithms. But ACS converged so rapidly that it always was in early stagnation. An improved Ant Colony System based on Negative Biased (NBACS) was introduced in the paper to overcome the early stagnation of the ACS. Experiments for Traveling Salesman Problem (TSP) showed that better solutions were obtained at the same time when the convergence rate accelerated more rapidly.

Sign in / Sign up

Export Citation Format

Share Document