메뉴 건너뛰기




Volumn 18, Issue 3, 2003, Pages 447-462

Optimization of hot rolled coil widths using a genetic algorithm

Author keywords

Assortment problem; Genetic algorithm; Mother coil; Selection schemes; Trim loss

Indexed keywords

GALVANIZING; GENETIC ALGORITHMS; HOT ROLLING; METAL CASTING;

EID: 0042154381     PISSN: 10426914     EISSN: None     Source Type: Journal    
DOI: 10.1081/AMP-120022021     Document Type: Article
Times cited : (17)

References (21)
  • 1
    • 0000378354 scopus 로고
    • Mathematical methods of organizing and planning production
    • Kantorovich, L. V. Mathematical methods of organizing and planning production. Management Sci. 1960, 6, 366-422.
    • (1960) Management Sci. , vol.6 , pp. 366-422
    • Kantorovich, L.V.1
  • 2
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting stock problem
    • Gilmore, P.C.; Gomory, R.E. A linear programming approach to the cutting stock problem. Oper. Res. 1961, 9, 849-859.
    • (1961) Oper. Res. , vol.9 , pp. 849-859
    • Gilmore, P.C.1    Gomory, R.E.2
  • 3
    • 0000143954 scopus 로고
    • A linear programming approach to the cutting stock problem, part 2
    • Gilmore, P.C.; Gomory, R.E. A linear programming approach to the cutting stock problem, part 2. Oper. Res. 1963, 11, 863-888.
    • (1963) Oper. Res. , vol.11 , pp. 863-888
    • Gilmore, P.C.1    Gomory, R.E.2
  • 4
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two or more dimensions
    • Gilmore, P.C.; Gomory, R.E. Multistage cutting stock problems of two or more dimensions. Oper. Res. 1965, 13, 94-120.
    • (1965) Oper. Res. , vol.13 , pp. 94-120
    • Gilmore, P.C.1    Gomory, R.E.2
  • 6
    • 0001547020 scopus 로고
    • An heuristic programming solution to a non linear cutting stock problem
    • Haessler, R.W. An heuristic programming solution to a non linear cutting stock problem. Management Sci. 1971, 17, B-793-802.
    • (1971) Management Sci. , vol.17
    • Haessler, R.W.1
  • 7
    • 0016509207 scopus 로고
    • Controlling cutting pattern changes in one dimensional trim problems
    • Haessler, R.W. Controlling cutting pattern changes in one dimensional trim problems. Oper. Res. 1975, 23, 483-493.
    • (1975) Oper. Res. , vol.23 , pp. 483-493
    • Haessler, R.W.1
  • 8
    • 0001882936 scopus 로고
    • A few remarks on the assortment problem
    • Sadowski, W. A few remarks on the assortment problem. Management Sci. 1959, 6, 13-24.
    • (1959) Management Sci. , vol.6 , pp. 13-24
    • Sadowski, W.1
  • 9
    • 0000568273 scopus 로고
    • Selecting the best lengths to stock
    • Wolfson, M.L. Selecting the best lengths to stock. Oper. Res. 1965, 13, 570-585.
    • (1965) Oper. Res. , vol.13 , pp. 570-585
    • Wolfson, M.L.1
  • 11
    • 0042802978 scopus 로고
    • A genetic algorithm for stock cutting: An exploration of mapping schemes
    • COMP3, February, Department of Computer and Mathematical Sciences, Victoria University
    • Hinterding R.; Juliff K. A Genetic Algorithm for Stock Cutting: An Exploration of Mapping Schemes. Technical Report 24. COMP3, February 1993, Department of Computer and Mathematical Sciences, Victoria University.
    • (1993) Technical Report , vol.24
    • Hinterding, R.1    Juliff, K.2
  • 12
    • 0041300196 scopus 로고
    • Genetic algorithms for cutting stock problems: With and without contiguity
    • COMP12, August, Victoria University
    • Hinterding R.; Khan I. Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity. Technical Report 40, COMP12, August 1994, Victoria University.
    • (1994) Technical Report , vol.40
    • Hinterding, R.1    Khan, I.2
  • 13
    • 0032657061 scopus 로고    scopus 로고
    • A genetic algorithm solution for one dimensional bundled stock cutting
    • Wagner, B.J. A genetic algorithm solution for one dimensional bundled stock cutting. European J. Oper. Res. 1999, 117, 368-381.
    • (1999) European J. Oper. Res. , vol.117 , pp. 368-381
    • Wagner, B.J.1
  • 14
    • 0030811462 scopus 로고    scopus 로고
    • Developing a simulated annealing algorithm for the cutting stock problem
    • Lai, K.K.; Jimmy, W.; Chan, M. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering 1997, 115-127.
    • (1997) Computers and Industrial Engineering , pp. 115-127
    • Lai, K.K.1    Jimmy, W.2    Chan, M.3
  • 15
    • 0025232910 scopus 로고
    • Approximate solutions for the cutting stock 'Portfolio' problem
    • Gemmil, D.D.; Sanders, J.L. Approximate solutions for the cutting stock 'Portfolio' problem. European J. Oper. Res. 1990, 44, 167-174.
    • (1990) European J. Oper. Res. , vol.44 , pp. 167-174
    • Gemmil, D.D.1    Sanders, J.L.2
  • 16
    • 0011717391 scopus 로고
    • A stochastic cutting stock procedure: Cutting rolls of insulating tape
    • Sculli, D. A stochastic cutting stock procedure: Cutting rolls of insulating tape. Management Sci. 1981, 27 (8), 946-952.
    • (1981) Management Sci. , vol.27 , Issue.8 , pp. 946-952
    • Sculli, D.1
  • 17
  • 19
    • 0041300195 scopus 로고    scopus 로고
    • A multiple-choice genetic algorithm for a nonlinear cutting stock problem
    • Bean, J.C. A multiple-choice genetic algorithm for a nonlinear cutting stock problem. IEEE Computing in Science and Engineering 2000, 2 (2), 80-83.
    • (2000) IEEE Computing in Science and Engineering , vol.2 , Issue.2 , pp. 80-83
    • Bean, J.C.1


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