메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 203-206

An adaptive parameter control strategy for ACO

Author keywords

Adaptive parameters; Ant colony optimization; Particle swarm optimization; TSP

Indexed keywords

COMBINATORIAL MATHEMATICS; GLOBAL OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EID: 33947204665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2006.258954     Document Type: Conference Paper
Times cited : (29)

References (11)
  • 2
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem
    • M. Dorigo, L. M. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation. 1997, 1(1): 53-66
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 4
    • 0037118189 scopus 로고    scopus 로고
    • ACO algorithms with guaranteed convergence to the optimal solution
    • W. J. Gutjahr. ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters. 2002, 82: 145-153
    • (2002) Information Processing Letters , vol.82 , pp. 145-153
    • Gutjahr, W.J.1
  • 5
    • 0036670452 scopus 로고    scopus 로고
    • A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms
    • T. Stützte, M. Dorigo. A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms. IEEE Transactions on Evolutionary Computation. 2002, 6(4): 58-365.
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.4 , pp. 58-365
    • Stützte, T.1    Dorigo, M.2
  • 6
    • 1342264192 scopus 로고    scopus 로고
    • A proof of convergence for Ant algorithms
    • A. Badr, A. Fahmy. A proof of convergence for Ant algorithms. Information Sciences. 2004, 160: 267 -279.
    • (2004) Information Sciences , vol.160 , pp. 267-279
    • Badr, A.1    Fahmy, A.2
  • 7
    • 84974718061 scopus 로고    scopus 로고
    • ACO Algorithm with Additional Reinforcement
    • Brussels, Belgium
    • S. Fidanova. ACO Algorithm with Additional Reinforcement. Third International Workshop, Brussels, Belgium, 2002: 292-293.
    • (2002) Third International Workshop , pp. 292-293
    • Fidanova, S.1
  • 8
    • 33749582378 scopus 로고    scopus 로고
    • Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems
    • M. Bubak et al, Eds, ICCS
    • S. Fidanova, Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems. M. Bubak et al. (Eds.): ICCS 2004, LNCS 3039, 2004, 523-530.
    • (2004) LNCS , vol.3039 , pp. 523-530
    • Fidanova, S.1
  • 10
    • 84974697709 scopus 로고    scopus 로고
    • M. L. Pilat, T. White, Using Genetic Algorithms to Optimize ACS-TSP, M.Dorigo et al. (Eds.):ANTS 2002, LNCS 2463, 2002: 282-287.
    • M. L. Pilat, T. White, Using Genetic Algorithms to Optimize ACS-TSP, M.Dorigo et al. (Eds.):ANTS 2002, LNCS 2463, 2002: 282-287.


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