Computer Science – Artificial Intelligence
Scientific paper
2012-02-07
Computer Science
Artificial Intelligence
Scientific paper
This article presents a new algorithm which is a modified version of the elite ant system (EAS) algorithm. The new version utilizes an effective criterion for escaping from the local optimum points. In contrast to the classical EAC algorithms, the proposed algorithm uses only a global updating, which will increase pheromone on the edges of the best (i.e. the shortest) route and will at the same time decrease the amount of pheromone on the edges of the worst (i.e. the longest) route. In order to assess the efficiency of the new algorithm, some standard traveling salesman problems (TSPs) were studied and their results were compared with classical EAC and other well-known meta-heuristic algorithms. The results indicate that the proposed algorithm has been able to improve the efficiency of the algorithms in all instances and it is competitive with other algorithms.
Didehvar Farzad
Rahmati Farhad
Yousefikhoshbakht Majid
No associations
LandOfFree
Modification of the Elite Ant System in Order to Avoid Local Optimum Points in the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modification of the Elite Ant System in Order to Avoid Local Optimum Points in the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modification of the Elite Ant System in Order to Avoid Local Optimum Points in the Traveling Salesman Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-579055