메뉴 건너뛰기




Volumn 18, Issue 1, 2003, Pages 45-48+57

Ant system algorithm in continuous space optimization

Author keywords

Ant system algorithm; Continuous function optimization; Trail remaining distribution function

Indexed keywords

ALGORITHMS; NONLINEAR PROGRAMMING; SCHEDULING; SIMULATION;

EID: 0037966575     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (34)

References (11)
  • 1
    • 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[J]. IEEE Trans Evol Comp, 1997, 1(1): 53-66.
    • (1997) IEEE Trans. Evol. Comp. , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 2
    • 0030082551 scopus 로고    scopus 로고
    • Ant system: Optimization by a colony of cooperating agents
    • Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans SMC: Part B, 1996, 26(1): 29-41.
    • (1996) IEEE Trans. SMC: Part B , vol.26 , Issue.1 , pp. 29-41
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 3
  • 5
    • 84947723901 scopus 로고    scopus 로고
    • Learning with delayed rewards in ant systems for the job-shop scheduling problem
    • Bruxelles
    • Boryczka U. Learning with delayed rewards in ant systems for the job-shop scheduling problem[A]. First Int Conf Rough Sets Current Trends Comp[C]. Bruxelles, 1998. 271-274.
    • (1998) First Int. Conf. Rough Sets Current Trends Comp. , pp. 271-274
    • Boryczka, U.1
  • 7
    • 0029252532 scopus 로고
    • Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
    • Maniezzo V, Dorigo M, Colorni A. Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem[J]. European J Oper Res, 1995, 81(1): 188-204.
    • (1995) European J. Oper. Res. , vol.81 , Issue.1 , pp. 188-204
    • Maniezzo, V.1    Dorigo, M.2    Colorni, A.3
  • 8
    • 0000127689 scopus 로고    scopus 로고
    • Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
    • Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp, 1999, 11(4): 358-369.
    • (1999) Infor. J. Comp. , vol.11 , Issue.4 , pp. 358-369
    • Maniezzo, V.1
  • 9
    • 0033312934 scopus 로고    scopus 로고
    • Ant system applied to the quadratic assignment problem
    • Maniezzo V, Colorni A. Ant system applied to the quadratic assignment problem[J]. IEEE Trans Knowl Data Eng, 1999, 11(5): 769-778.
    • (1999) IEEE Trans. Knowl. Data Eng. , vol.11 , Issue.5 , pp. 769-778
    • Maniezzo, V.1    Colorni, A.2
  • 10
    • 84901447899 scopus 로고    scopus 로고
    • A new version of ant system for subset problems
    • Darmstadt
    • Leguizamon G, Michalewicz Z. A new version of ant system for subset problems[A]. Proc Congr Evol Comp[C]. Darmstadt, 1999. 2: 1459-1464.
    • (1999) Proc. Congr. Evol. Comp. , vol.2 , pp. 1459-1464
    • Leguizamon, G.1    Michalewicz, Z.2
  • 11
    • 0003170466 scopus 로고    scopus 로고
    • A clustering method using genetic algorithm and ant system
    • Spring verlag
    • Douzono H, Hara S, Kawamoto S, et al. A clustering method using genetic algorithm and ant system[A]. Joint Conf Intell Syst[C]. Spring verlag, 1998. 2: 407-410.
    • (1998) Joint Conf. Intell. Syst. , vol.2 , pp. 407-410
    • Douzono, H.1    Hara, S.2    Kawamoto, S.3


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