메뉴 건너뛰기




Volumn 51, Issue 11, 2000, Pages 1289-1295

Resolution of strip-packing problems with genetic algorithms

Author keywords

Combinatorial optimisation; Genetic algorithms; Heuristics; Strip packing

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PACKAGING; PROBLEM SOLVING; STRATEGIC PLANNING;

EID: 0342903331     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601019     Document Type: Article
Times cited : (18)

References (15)
  • 1
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting-stock problem
    • Gilmore PC and Gomory RE (1961). A linear programming approach to the cutting-stock problem. Opns Res 9: 724-746.
    • (1961) Opns Res , vol.9 , pp. 724-746
    • Gilmore, P.C.1    Gomory, R.E.2
  • 2
    • 33750289018 scopus 로고
    • A linear programming approach to the cutting stock problem
    • Gilmore PC and Gomory E (1963). A linear programming approach to the cutting stock problem. Opns Res 11: 863 - 888.
    • (1963) Opns Res , vol.11
    • Gilmore, P.C.1    Gomory, E.2
  • 3
    • 0002662534 scopus 로고
    • Multi stage cutting stock problems of two and more dimensions
    • Gilmore PC and Gomory RE (1965). Multi stage cutting stock problems of two and more dimensions. Opns Res 13: 94 -112.
    • (1965) Opns Res , vol.13
    • Gilmore, P.C.1    Gomory, R.E.2
  • 4
    • 0025210672 scopus 로고
    • A typology of cutting and packing problem
    • Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145 -159.
    • (1990) Eur J Opl Res , vol.44
    • Dyckhof1
  • 5
    • 0025256644 scopus 로고
    • Average-case analysis of cutting and packing in two dimensions
    • Coffman EG and Shor PW (1990). Average-case analysis of cutting and packing in two dimensions. Eur J Opl Res 44: 134-144.
    • (1990) Eur J Opl Res , vol.44 , pp. 134-144
    • Coffman, E.G.1    Shor, P.W.2
  • 6
    • 0030571698 scopus 로고    scopus 로고
    • On genetic algorithms for the packing of polygons
    • Jakobs S (1996). On genetic algorithms for the packing of polygons. Eur J Opl Res 88: 165-181.
    • (1996) Eur J Opl Res , vol.88 , pp. 165-181
    • Jakobs, S.1
  • 11
    • 3142754439 scopus 로고
    • Presented at the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ
    • Goldberg DE and Lingle R (1985). Alleles, Loci, and the TSP. Presented at the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, pp 154-159.
    • (1985) Alleles, Loci, and the TSP , pp. 154-159
    • Goldberg, D.E.1    Lingle, R.2
  • 12
    • 0000150947 scopus 로고
    • Presented at the International Joint Conference on Artificial Intelligence
    • Davis L (1985). Applying Adaptive Algorithms to Epistatic Domains. Presented at the International Joint Conference on Artificial Intelligence, pp 162-164.
    • (1985) Applying Adaptive Algorithms to Epistatic Domains , pp. 162-164
    • Davis, L.1
  • 15
    • 84984726085 scopus 로고
    • Presented at the Sixth International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann Publishers
    • Belding T (1995). The Distributed Genetic Algorithm. Presented at the Sixth International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann Publishers.
    • (1995) The Distributed Genetic Algorithm
    • Belding, T.1


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