A novel max-min ant system algorithm for traveling salesman problem

Proceedings - 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2009

Volumn 1, Issue , 2009, Pages 508-511

  Zhang, Zhaojun ^a   Feng, Zuren ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Ant colony optimization; Max Min ant system; Pheromone; Traveling salesman problem

Indexed keywords

ANT ALGORITHMS; ANT-COLONY OPTIMIZATION; CONVERGENCE RATES; MAX-MIN ANT SYSTEM; OBJECTIVE FUNCTION VALUES; OPTIMAL SOLUTIONS; PHEROMONE TRAILS; RANDOM SAMPLING; SIMULATION RESULT; TWO PHASIS; UPPER AND LOWER BOUNDS;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; INTELLIGENT COMPUTING; INTELLIGENT SYSTEMS; OPTIMAL SYSTEMS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 77949650152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICISYS.2009.5357792     Document Type: Conference Paper

References (11)

1. M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: optimization by a colony of cooperating agents," IEEE Trans on Systems, Man, and Cybernetics-Part B, vol. 26, pp. 29-41, 1996.
2. M. Dorigo, and L. M.Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem," IEEE Trans on Evolutionary Computation, vol. 1, pp. 53-66, 1997.
3. T. Stützle, and H. H. Hoos, "Max-Min ant system," Future Generation Computer Systems, vol. 16, pp. 889-914, 2000.
4. B. Bullnheimer, R. F. Hartl, and C. Strauss, "A new rank-based version of the Ant System: A computational study," Central European Journal for Operations Research and Economics, vol. 7, pp. 25-38. 1999.
5. C. Blum, and M. Dorigo, "The hyper-cube framework for ant colony optimization," IEEE Trans on Systems, Man, and Cybernetics-Part B, vol. 34, pp. 1161-1171, 2004.
6. L. M. Gambardella, E. D. Taillard and M. Dorigo, "Ant Colonies for the Quadratic Assignment Problem," The Journal of the Operational Research Society, vol. 50, pp. 167-176, 1999.
7. J. Heinonen, and F. Pettersson, "Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem," Applied Mathematics and Computation, vol. 187, pp. 989-998, 2007.
8. S. U. Seckiner, and M. Kurt, "Ant colony optimization for the job rotation scheduling problem," Applied Mathematics and Computation, vol. 201, pp. 149-160, 2008.
9. Yu Bin, Yang Zhongzhen, and Yao Baozhen, "An improved ant colony optimization for vehicle routing problem," European Journal of Operational Research, vol. 196, pp. 171-176, 2009.
10. L. Lessingm, I. Dumitrescu, and T. Stützle, "A comparison between ACO algorithms for the set covering problem," Lecture Notes in Computer Science, vol. 3172, pp. 1-12, 2004.
11. K. Socha, and, M. Dorigo, "Ant colony optimization for continuous domains," European Journal of Operational Research, vol. 185, pp. 1155-1173, 2008.