메뉴 건너뛰기




Volumn , Issue , 2012, Pages 728-732

A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems

Author keywords

0 1 Knapsack Problem; Ant Colony; MapReduce; Meta heuristics; Traveling Salesman Problem

Indexed keywords

0-1 KNAPSACK PROBLEM; ACO ALGORITHMS; ALGORITHM DESIGN; ANT COLONIES; ANT COLONY OPTIMIZATION (ACO); ANT COLONY OPTIMIZATION ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; DATA SETS; MAP-REDUCE; META HEURISTICS; META-HEURISTICS ALGORITHMS; NP-HARD; OPTIMAL SOLUTIONS; PARALLELIZATIONS; SOCIAL BEHAVIOR;

EID: 84866182621     PISSN: 21579555     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2012.6234645     Document Type: Conference Paper
Times cited : (24)

References (12)
  • 5
    • 0030189224 scopus 로고    scopus 로고
    • Divi de and conquer strategies for parallel tsp heuristics
    • July
    • G. Cesari. Divi de and conquer strategies for parallel tsp heuristics. Comput. Oper. Res., 23:681-694, July 1996.
    • (1996) Comput. Oper. Res. , vol.23 , pp. 681-694
    • Cesari, G.1


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