Robust and Efficient Ant Colony Algorithm; Using New Local Updating Rule

In this paper, two new robust ant colony algorithms with better results will be presented. The main approach to improve older algorithms is to use an intelligent local updating method. Here all agents haven't the same effects on the paths; local updating is done based on the situation and rout...

Full description

Saved in:
Bibliographic Details
Main Authors: Taherinejad, N., Naimi, H.M.
Format: Conference Proceeding
Language:English
Subjects:
Ant Colony Algorithm
Ant colony optimization
Cities and towns
Heuristic algorithms
Joining processes
Libraries
Local Updating
NP-hard problem
Optimizing
Robustness
Signal processing algorithms
Testing
Traveling salesman problems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, two new robust ant colony algorithms with better results will be presented. The main approach to improve older algorithms is to use an intelligent local updating method. Here all agents haven't the same effects on the paths; local updating is done based on the situation and rout passed by agents. In order to evaluate and compare the results of new algorithm many standard problems of TSP Library and some random problems were tested. The experiments proved the better results of new algorithm and also its considerable better robustness.
DOI:10.1109/ICSPC.2007.4728280