메뉴 건너뛰기




Volumn , Issue , 2011, Pages 32-35

An improved genetic algorithm for 0-1 knapsack problems

Author keywords

0 1 knapsack problems; Dual population genetic algorithm; Greedy criterion; Population collaboration; Sub group competition

Indexed keywords

0-1 KNAPSACK PROBLEM; DUAL-POPULATION GENETIC ALGORITHM; GREEDY CRITERION; POPULATION COLLABORATION; SUB-GROUP COMPETITION;

EID: 80455174253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNDC.2011.14     Document Type: Conference Paper
Times cited : (12)

References (10)
  • 1
    • 35048819998 scopus 로고    scopus 로고
    • Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using e-dominance
    • C. Grosan and M. Oltean, "Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using e-dominance," in International Conference on Computational Science, pp. 674-677, 2004.
    • (2004) International Conference on Computational Science , pp. 674-677
    • Grosan, C.1    Oltean, M.2
  • 3
    • 80455122619 scopus 로고    scopus 로고
    • Two-population genetic algorithm based on elimination mechanism
    • F. BiHe and Y. LeiLei, "Two-population genetic algorithm based on elimination mechanism," Operations Research, 2009.
    • (2009) Operations Research
    • He, F.B.1    Lei, Y.L.2
  • 8
    • 33846894350 scopus 로고    scopus 로고
    • Greedy algorithm for the general multidimensional knapsack problem
    • X. S. H. AKCAY Y, LI Haijun, "Greedy algorithm for the general multidimensional knapsack problem," Operations Research, pp. 17-29, 2007.
    • (2007) Operations Research , pp. 17-29
    • Akcay, Y.X.S.H.1    Li, H.2
  • 10
    • 80455122621 scopus 로고    scopus 로고
    • An improved genetic algorithm for knapsack problem
    • Y. T. S, "An improved genetic algorithm for knapsack problem," Modern Computer, pp. 44-47, 2009.
    • (2009) Modern Computer , pp. 44-47
    • Y, T.S.1


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