메뉴 건너뛰기




Volumn 28, Issue 8, 2011, Pages 1071-1080

Binary ant colony algorithm with controllable search bias

Author keywords

0 1 multiple knapsack problem; Ant colony algorithm; Binary ant colony algorithm; Controllable search; Functionoptimization; Pheromone update pattern

Indexed keywords

ANT COLONY ALGORITHMS; BINARY ANT COLONY ALGORITHMS; CONTROLLABLE SEARCH; FUNCTIONOPTIMIZATION; MULTIPLE KNAPSACK PROBLEM; UPDATE PATTERNS;

EID: 80053974888     PISSN: 10008152     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (6)

References (19)
  • 3
    • 34248174240 scopus 로고    scopus 로고
    • Ant colony evolutionary algorithm
    • XIONG Weiqing, WEI Ping. Ant colony evolutionary algorithm[J]. Acta Automatica Sinica, 2007, 33(3): 259-264.
    • (2007) Acta Automatica Sinica , vol.33 , Issue.3 , pp. 259-264
    • Xiong, W.1    Wei, P.2
  • 4
    • 66149104421 scopus 로고    scopus 로고
    • Multi-population binary ant colony algorithm with congestion control strategy
    • YAN Bin, XIONG Weiqing, CHEN Meiying, et al. Multi-population binary ant colony algorithm with congestion control strategy[J]. Control Theory & Applications, 2009, 26(4): 387-394.
    • (2009) Control Theory & Applications , vol.26 , Issue.4 , pp. 387-394
    • Yan, B.1    Xiong, W.2    Chen, M.3
  • 6
    • 17644402086 scopus 로고    scopus 로고
    • Search bias in ant colony optimization: on the role of competition-balanced systems
    • BLUM C, DORIGO M. Search bias in ant colony optimization: on the role of competition-balanced systems[J]. IEEE Transactions on Evolutionary Computation, 2005, 9(2): 159-174.
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.2 , pp. 159-174
    • Blum, C.1    Dorigo, M.2
  • 7
    • 0037118189 scopus 로고    scopus 로고
    • ACO algorithms with guaranteed convergence to the optimal solution
    • WALTER J, GUTJAHR. ACO algorithms with guaranteed convergence to the optimal solution[J]. Information Processing Letters, 2002, 82(3): 145-153.
    • (2002) Information Processing Letters , vol.82 , Issue.3 , pp. 145-153
    • Walter, J.1    Gutjahr2
  • 8
    • 0036670452 scopus 로고    scopus 로고
    • A short convergence proof for a class of ant colony optimization algorithms
    • STüTZLE T G, DORIGO M. A short convergence proof for a class of ant colony optimization algorithms[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(4): 358-365.
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.4 , pp. 358-365
    • Stützle, T.G.1    Dorigo, M.2
  • 10
    • 0344644472 scopus 로고    scopus 로고
    • Model-based search for combinatorial optimization: a critical survey
    • ZLOCHIN M, BIRATTARI M, MEULEAU N, et al. Model-based search for combinatorial optimization: a critical survey[J]. Annals of Operations Research, 2004, 131(1/4): 373-395.
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 373-395
    • Zlochin, M.1    Birattari, M.2    Meuleau, N.3
  • 11
    • 38749091758 scopus 로고    scopus 로고
    • Solution bias in ant colony optimisation: Lessons for selecting pheromone models
    • MONTGOMERY J, RANDALL M, HENDTLASS T. Solution bias in ant colony optimisation: Lessons for selecting pheromone models[J]. Computers and Operations Research, 2008, 35(9): 2728-2749.
    • (2008) Computers and Operations Research , vol.35 , Issue.9 , pp. 2728-2749
    • Montgomery, J.1    Randall, M.2    Hendtlass, T.3
  • 14
    • 64049119705 scopus 로고    scopus 로고
    • A new solution algorithm for improving performance of ant colony optimization
    • BASKAN O, HALDENBILEN S, CEYLAN H, et al. A new solution algorithm for improving performance of ant colony optimization[J]. Applied Mathematics and Computation, 2009, 211(1): 75-84.
    • (2009) Applied Mathematics and Computation , vol.211 , Issue.1 , pp. 75-84
    • Baskan, O.1    Haldenbilen, S.2    Ceylan, H.3
  • 15
    • 34548441531 scopus 로고    scopus 로고
    • A heuristic approach to find the global optimum of function
    • TOKSAR M D. A heuristic approach to find the global optimum of function[J]. Journal of Computational and Applied Mathematics, 2007, 209(2): 160-66.
    • (2007) Journal of Computational and Applied Mathematics , vol.209 , Issue.2 , pp. 160-66
    • Toksar, M.D.1
  • 16
    • 2942529349 scopus 로고    scopus 로고
    • Continuous interacting ant colony algorithm based on dense hierarchy
    • DREO J, SIARRY P. Continuous interacting ant colony algorithm based on dense hierarchy[J]. Future Generation Computer Systems, 2004, 20(5): 841-856.
    • (2004) Future Generation Computer Systems , vol.20 , Issue.5 , pp. 841-856
    • Dreo, J.1    Siarry, P.2


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