A novel AGO algorithm with adaptive parameter

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4115 LNBI -III, Issue , 2006, Pages 12-21

  Huang, Han ^a   Yang, Xiaowei ^a   Hao, Zhifeng ^a,b   Cai, Ruichu ^a  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b SOUTHEAST UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVE WEIGHT ANT COLONY SYSTEM (AWACS); ANT COLONY OPTIMIZATION; PHEROMONE TRAIL;

ADAPTIVE ALGORITHMS;

EID: 33749540150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11816102_2     Document Type: Conference Paper

References (19)

1. Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Massachusetts Institute of Technology, Artificial Life 5 (1999) 137-172
2. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approah to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), (1997) 53-66
3. Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Gener. Comput. Syst., Vol.16, No. 8, (2000) 889-914
4. Gutjahr, W.J.: Ageneralized Convergence Result for the Graph-Based Ant System Metaheuristic. Tech. Report 99-09, Department of Statistics and Decision Support Systems, University of Vienna, Austria (1999)
5. Gutjahr, W.J.: Agraph-Based Ant System and Its Convergence. Future Gen. Comput. Systems 16 (9) (2000) 873-888
6. Gutjahr, W.J.: ACO Algorithms with Guaranteed Convergence to the Optimal Solution. Information Processing Letters 82 (2002) 145-153
7. Stützle, T., Dorigo M.: A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms. IEEE Transactions on Evolutionary Computation 6 (4) (2002) 358-365
8. Dorigo, M, Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge, MA (2004)
9. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344 (2005) 243-278
10. Badr, A., Fahmy, A.: A Proof of Convergence for Ant Algorithms. Information Sciences 160 (2004) 267-279
11. Fidanova, S.: ACO Algorithm with Additional Reinforcement. M. Dorigo et al. (Eds.): ANTS 2002, LNCS 2463 (2002) 292-293
12. Fidanova, S.: Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems. M. Bubak et al. (Eds.):ICCS 2004, LNCS 3039 (2004) 523-530
13. Watanabe, I., Matsui, S.: Improving the Performance of ACO Algorithms by Adaptive Control of Candidate Set. Evolutionary Computation, 2003. CEC '03. The 2003 Congress on 2 (8-12) (2003) 1355-1362
14. Pilat, M.L., White, T.: Using Genetic Algorithms to Optimize ACS-TSP. M. Dorigo et al. (Eds.):ANTS 2002, LNCS 2463, (2002) 282-287
15. Zecchin, A.C., Simpson, A.R., Maier, H.R., Nixon, J.B.: Parametric Study for an Ant Algorithm Applied to Water Distribution System Optimization. IEEE Transactions on evolutionary computation, Vol. 9 No. 2 April (2005)
16. Dorigo, M., Gambardella L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43 (1997) 73-81
17. Sim, K.M., Sun, W.H.: Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans Vol. 33 No. 5 September (2003)
18. Blum, C., Dorigo, M.: Search Bias in Ant Colony Optimization: On the Role of Competition-Balanced Systems. IEEE Transactions on evolutionary computation, Vol. 9 No. 2 April (2005)
19. Reinelt, G.: TSPLIB. A Traveling Salesman Problem Library, ORSA Journal on Computing. 3(4) (1991) 376-384