An Effective Ant Colony Algorithm for the Traveling Salesman Problem
Publish place: Journal of Advances in Computer Research، Vol: 7، Issue: 3
Publish Year: 1395
Type: Journal paper
Language: English
View: 456
This Paper With 16 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_JACR-7-3_007
Index date: 1 January 2017
An Effective Ant Colony Algorithm for the Traveling Salesman Problem abstract
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
An Effective Ant Colony Algorithm for the Traveling Salesman Problem Keywords:
An Effective Ant Colony Algorithm for the Traveling Salesman Problem authors
Majid Yousefikhoshbakht
Young Researchers & Elite Club, Hamedan Branch, IslamicAzadUniversity, Hamedan, Iran
Azam Dolatnejad
Young Researchers & Elite Club, Tehran North Branch, Islamic Azad University, Tehran, Iran