메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 596-603

Weight-codings in a genetic algorithm for the multi-constraint knapsack problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DECODING;

EID: 84901455281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.781987     Document Type: Conference Paper
Times cited : (25)

References (22)
  • 1
    • 0000369074 scopus 로고    scopus 로고
    • Obtaining test problems via internet
    • J. E. Beasley: Obtaining Test Problems via Internet, Journal of Global Optimization 8, pp. 429-433, 1996.
    • (1996) Journal of Global Optimization , vol.8 , pp. 429-433
    • Beasley, J.E.1
  • 2
    • 85001907733 scopus 로고    scopus 로고
    • A weight-coded genetic algorithm for the minimum weight triangulation problem
    • ACM Press
    • K. Capp, B. Julstrom: A Weight-Coded Genetic Algorithm for the Minimum Weight Triangulation Problem, in Proc. of the 1998 ACM Symposium on Applied Computing, ACM Press, pp. 327-331, 1998.
    • (1998) Proc. of the 1998 ACM Symposium on Applied Computing , pp. 327-331
    • Capp, K.1    Julstrom, B.2
  • 4
    • 0032090794 scopus 로고    scopus 로고
    • A genetic algorithm for the multidimensional knapsack problem
    • P. C. Chu, J. E. Beasley: A Genetic Algorithm for the Multidimensional Knapsack Problem, Journal of Heuristics 4, pp. 63-86, 1998.
    • (1998) Journal of Heuristics , vol.4 , pp. 63-86
    • Chu, P.C.1    Beasley, J.E.2
  • 6
    • 24644482140 scopus 로고    scopus 로고
    • Evolutionary algorithms for multidimensional knapsack problems: The relevance of the boundary of the feasible region
    • submitted to, Orlando, FL
    • J. Gottlieb: Evolutionary Algorithms for Multidimensional Knapsack Problems: The Relevance of the Boundary of the Feasible Region, submitted to the Genetic and Evolutionary Computation Conf., Orlando, FL, 1999.
    • (1999) The Genetic and Evolutionary Computation Conf.
    • Gottlieb, J.1
  • 9
    • 0038588241 scopus 로고    scopus 로고
    • Representing rectilinear steiner trees in genetic algorithms
    • ACM Press
    • B. Julstrom: Representing Rectilinear Steiner Trees in Genetic Algorithms, in Proc. of the 1996 ACM Symposium on Applied Computing, ACM Press, pp. 245-250, 1996.
    • (1996) Proc. of the 1996 ACM Symposium on Applied Computing , pp. 245-250
    • Julstrom, B.1
  • 10
  • 11
    • 72749095053 scopus 로고    scopus 로고
    • Insertion decoding algorithms and initial tours in a weight-coded GA for TSP
    • Madison, Wisconsin
    • B. Julstrom: Insertion Decoding Algorithms and Initial Tours in a Weight-Coded GA for TSP, in Proc. of the 3rd Genetic Programming Conf., Madison, Wisconsin, pp. 528-534, 1998.
    • (1998) Proc. of the 3rd Genetic Programming Conf. , pp. 528-534
    • Julstrom, B.1
  • 13
    • 0021442262 scopus 로고
    • A heuristic algorithm for the multidimensional zero-one knapsack problem
    • M. J. Magazine, O. Oguz: A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem, European Journal of Operational Research 16, pp. 319-326, 1984.
    • (1984) European Journal of Operational Research , vol.16 , pp. 319-326
    • Magazine, M.J.1    Oguz, O.2
  • 17
    • 0023332292 scopus 로고
    • A heuristic solution procedure for the multiconstrained zero-one knapsack problem
    • H. Pirkul: A Heuristic Solution Procedure for the Multiconstrained Zero-One Knapsack Problem, Naval Research Logistics 34, pp. 161-172, 1987.
    • (1987) Naval Research Logistics , vol.34 , pp. 161-172
    • Pirkul, H.1
  • 18
    • 0031704179 scopus 로고    scopus 로고
    • An improved genetic algorithm for the multiconstrained 0-1 knapsack problem
    • Anchorage, Alaska
    • G. R. Raidl: An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem, in Proc. of the 5th IEEE Int. Conf. on Evolutionary Computation, Anchorage, Alaska, pp. 207-211, 1998.
    • (1998) Proc. of the 5th IEEE Int. Conf. on Evolutionary Computation , pp. 207-211
    • Raidl, G.R.1
  • 19
    • 0032688840 scopus 로고    scopus 로고
    • A weight-coded genetic algorithm for the multiple container packing problem
    • San Antonio, TX
    • G. R. Raidl: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem, to appear in Proc. of the 14th ACM Symposium on Applied Computing, San Antonio, TX, 1999.
    • (1999) Proc. of the 14th ACM Symposium on Applied Computing
    • Raidl, G.R.1
  • 21
    • 0000949659 scopus 로고
    • Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms
    • J. Thiel, S. Voss: Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms, INFOR 32, pp. 226-242, 1994.
    • (1994) INFOR , vol.32 , pp. 226-242
    • Thiel, J.1    Voss, S.2
  • 22


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