메뉴 건너뛰기




Volumn 4490 LNCS, Issue PART 4, 2007, Pages 1167-1170

An ACO algorithm with adaptive volatility rate of pheromone trail

Author keywords

Adaptive volatility rate; Ant colony optimization; Pheromone trail

Indexed keywords

ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING;

EID: 38149093331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72590-9_175     Document Type: Conference Paper
Times cited : (23)

References (9)
  • 1
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for Discrete Optimization, Massachusetts Institute of Technology
    • Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for Discrete Optimization, Massachusetts Institute of Technology, Artificial Life 5: 137-172, 1999
    • (1999) Artificial Life , vol.5 , pp. 137-172
    • Dorigo, M.1    Caro, G.D.2    Gambardella, L.M.3
  • 2
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem
    • Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1 (1), 53-66, 1997
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 4
    • 36448987096 scopus 로고    scopus 로고
    • Watanabe, I., Matsui, S.L.: Improving the Performance of ACO Algorithms by Adaptive Control of Candidate Set, Evolutionary Computation, 2003. CEC '03. The 2003 Congress on 2, 8-12 Dec. 2003 Page(s):1355-1362 2
    • Watanabe, I., Matsui, S.L.: Improving the Performance of ACO Algorithms by Adaptive Control of Candidate Set, Evolutionary Computation, 2003. CEC '03. The 2003 Congress on Volume 2, 8-12 Dec. 2003 Page(s):1355-1362 Vol.2
  • 5
    • 84974697709 scopus 로고    scopus 로고
    • Pilat, M.L., White, T.: Using Genetic Algorithms to Optimize ACS-TSP, M. Dorigo et al. (Eds.):ANTS 2002, LNCS 2463, 282-287, 2002
    • Pilat, M.L., White, T.: Using Genetic Algorithms to Optimize ACS-TSP, M. Dorigo et al. (Eds.):ANTS 2002, LNCS 2463, 282-287, 2002
  • 6
    • 38149114967 scopus 로고    scopus 로고
    • Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning approach to the travelling salesman problem, Appeared in: Proceedings of ML-95, Twelfth Intern. Conf. On Machine Learning, Morgan Kaufmann, 252-260, 1995
    • Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning approach to the travelling salesman problem, Appeared in: Proceedings of ML-95, Twelfth Intern. Conf. On Machine Learning, Morgan Kaufmann, 252-260, 1995
  • 7
    • 33749540150 scopus 로고    scopus 로고
    • Huang H., Yang X.W., Hao Z.F., Cai R.C.: A novel ACO algorithm with adaptive parameter, D.S. Huang et al. (Eds.): ICIC 2006, LNBI 4115, 12-21, 2006
    • Huang H., Yang X.W., Hao Z.F., Cai R.C.: A novel ACO algorithm with adaptive parameter, D.S. Huang et al. (Eds.): ICIC 2006, LNBI 4115, 12-21, 2006
  • 9
    • 0026225350 scopus 로고
    • TSPLIB. A traveling salesman problem library
    • Reinelt, G.: TSPLIB. A traveling salesman problem library. ORSA Journal on Computing, 3 (4), 376-384, 1991
    • (1991) ORSA Journal on Computing , vol.3 , Issue.4 , pp. 376-384
    • Reinelt, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.