An Effective Ant Colony Algorithm for the Traveling Salesman Problem

The traveling salesman problem (TSP) is a well-known combinatorial optimization problem and holds a central place in logistics management. The TSP has received much attention because of its practical applications in industrial problems. Many exact, heuristic and metaheuristic approaches have been proposed to solve TSP in recent years. In this paper, a modified ant colony optimization (MACO) is presented which possesses a new strategy to update the increased pheromone, a candidate list and a mutation operation to solve the TSP. In addition, some local search algorithms are utilized as an effective criterion and only a global updating is used in order to

کلیدواژه ها:

Traveling Salesman Problem ، Ant Colony Optimization ، Global Updating ، NPhard Problems