메뉴 건너뛰기




Volumn 35, Issue 8, 2008, Pages 2672-2683

A new ant colony optimization algorithm for the multidimensional Knapsack problem

Author keywords

Ant colony optimization; Binary ant system; Combinatorial optimization; Multidimensional Knapsack problem

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION;

EID: 36849024458     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.029     Document Type: Article
Times cited : (125)

References (15)
  • 3
    • 1842611240 scopus 로고    scopus 로고
    • The MIT Press, Cambridge, Massachusetts, London, England
    • Dorigo M., and Stützle T. Ant colony optimization (2004), The MIT Press, Cambridge, Massachusetts, London, England
    • (2004) Ant colony optimization
    • Dorigo, M.1    Stützle, T.2
  • 4
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: a cooperative learning approach to the traveling salesman problem
    • Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolution and Computation 1 (1997) 53-66
    • (1997) IEEE Transactions on Evolution and Computation , vol.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 5
  • 6
    • 0001834106 scopus 로고    scopus 로고
    • MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
    • Corne D., Dorigo M., and Glover F. (Eds), McGraw-Hill, London, UK
    • Gambardella L.M., Taillard E.D., and Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London, UK 63-76
    • (1999) New ideas in optimization , pp. 63-76
    • Gambardella, L.M.1    Taillard, E.D.2    Agazzi, G.3
  • 10
    • 0023332292 scopus 로고
    • A heuristic solution procedure for the multiconstraint zero-one knapsack problem
    • Pirkul H. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics 34 (1987) 161-172
    • (1987) Naval Research Logistics , vol.34 , pp. 161-172
    • Pirkul, H.1
  • 11
    • 0032090794 scopus 로고    scopus 로고
    • A genetic algorithm for the multidimentional knapsack problem
    • Chu P.C., and Beasley J.E. A genetic algorithm for the multidimentional knapsack problem. Journal of Heuristic 4 (1998) 63-86
    • (1998) Journal of Heuristic , vol.4 , pp. 63-86
    • Chu, P.C.1    Beasley, J.E.2
  • 12
    • 84866721226 scopus 로고    scopus 로고
    • Alaya I, Solnon C, Ghéira K. Ant algorithm for the multi-dimensional knapsack problem. International conference on bioinspired optimization methods and their applications. BIOMA 2004, October 2004, p. 63-72.
  • 13
    • 36849072695 scopus 로고    scopus 로고
    • Fidanova S. Evolutionary algorithm for multidimensional knapsack problem. PPSNVII-Workshop 2002.
  • 14
    • 84901447899 scopus 로고    scopus 로고
    • Leguizamon G, Michalewicz Z. A New version of ant system for subset problem. Congress on evolutionary computation, 1999; p. 1459-64.
  • 15
    • 36849089168 scopus 로고    scopus 로고
    • Stützle T. ACOTSP, Version 1.0. Available from 〈http://www.aco-metaheuristic.org/aco-code〉, 2004.


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