A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
An Ant Colony Optimization Algorithm with Evolutionary Operator for Traveling Salesman Problem
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Improved Ant Colony Algorithm and its Applications in TSP
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 03
A Novel Immunity-Growth Genetic Algorithm for Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 05
The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm
International Journal of Bio-Inspired Computation
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An ant colony optimisation algorithm for constructing phylogenetic tree
International Journal of Computer Applications in Technology
A method for avoiding the searching bias in ACO deceptive problem solving
Web Intelligence and Agent Systems
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
Hi-index | 0.00 |
In this paper, a modified max-min ant system, called dynamic max-min ant system (DMAS) is proposed to solve the travelling salesman problem (TSP). The proposed algorithm updates the value of τmin, the lower bound of pheromone trails during its run. In addition, the used parameters for the DMAS are adjusted to improve the performance of the method. Furthermore, a local search based on 2-Opt is adjoined to the DMAS and the results are reported. Moreover, the DMAS is applied to some standard TSPs and its results are compared to some previous works. Results show that the proposed method outperforms several other well-known population-based methods in many cases. Also, in some standard problems, the proposed method improves the shortest known tour lengths. Moreover, experiments show that the standard deviation of tour lengths that are found by DMAS is very small, which exhibits the stability of the proposed algorithm.