Journal of Sensor Science and Technology (센서학회지)

The Korean Sensors Society (한국센서학회)
권호 표지
DOI QR코드

DOI QR Code

Optimization of LCD Panel Cutting Problem Using 0-1 Mixed Integer Programming

0-1 혼합정수계획법을 이용한 LCD 패널 절단 문제 최적화

  • Kim, Kidong (Department of System & Management Engineering, Kangwon National University) ;
  • Park, Hyeon Ji (Department of System & Management Engineering, Kangwon National University) ;
  • Shim, Yun-Seop (Development Part, 3View. Com Inc.) ;
  • Jeon, Tae Bo (Department of System & Management Engineering, Kangwon National University)
  • 김기동 (강원대학교 시스템경영공학과) ;
  • 박현지 (강원대학교 시스템경영공학과) ;
  • 심윤섭 (쓰리뷰 개발팀) ;
  • 전태보 (강원대학교 시스템경영공학과)
  • Received : 2017.06.20
  • Accepted : 2017.07.26
  • Published : 2017.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

LCD(Liquid Crystal Display) panel cutting problem is a sort of two dimensional cutting stock problem. A cutting stock problem is problem that it minimizes the loss of the stock when a stock is cut into various parts. In the most research of the two dimensional cutting stock problem, it is supposed that the relative angle of a stock and parts is not important. Usually the angle is regarded as horizontal or perpendicular. In the manufacturing of polarizing film of LCD, the relative angle should be maintained at some specific angle because of the physical and/or chemical characteristics of raw material. We propose a mathematical model for solving this problem, a two-dimensional non-Guillotine cutting stock problem that is restricted by an arranged angle. Some example problems are solved by the C++ program using ILOG CPLEX classes. We could get the verification and validation of the suggested model based on the solutions.

Keywords

References

  1. G. Wascher, H. Hausner, and H. Schumann, "An improved typology of cutting and packing problems", Eur J Oper Res., Vol. 183, pp.1109-1130, 2007. https://doi.org/10.1016/j.ejor.2005.12.047
  2. P. C. Gilmore, and R. E. Gomory, "A linear programming approach to the cutting stock problem-partII", Oper Res., Vol. 11, pp.863-888, 1963. https://doi.org/10.1287/opre.11.6.863
  3. P. C. Gilmore, and R. E. Gomory, "A linear programming approach to the cutting stock problem", Oper Res., Vol. 9, pp.849-859, 1961. https://doi.org/10.1287/opre.9.6.849
  4. M. Gradisar, and P. Trkman, "A combined approach to the solution to the general one-dimensional cutting stock problem", Comput. Oper Res., Vol. 32, pp.1793-1807, 2005. https://doi.org/10.1016/j.cor.2003.11.028
  5. S. Umetani, M. Yagiura, and T. Ibaraki, "One-dimensional cutting stock problem to minimize the number of different patterns", Eur J Oper Res., Vol. 146, pp.388-402, 2003. https://doi.org/10.1016/S0377-2217(02)00239-4
  6. P. C. Gilmore, and R. E. Gomory, "Multistage cutting stock problems of two and more dimensions", Oper Res., Vol. 13, pp.94-120, 1965. https://doi.org/10.1287/opre.13.1.94
  7. M. Hifi, "An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock", Comput. Oper Res., Vol. 24, pp.727-36, 1997. https://doi.org/10.1016/S0305-0548(96)00095-0
  8. F. Vanderbeck, "A nested decomposition approach to a three-stage, two dimensional cutting-stock problem", Manag. Sci., Vol. 47, pp.864-79, 2001. https://doi.org/10.1287/mnsc.47.6.864.9809
  9. E. K. Burke, G. Kendall, and G. Whitwell, "A new placement heuristic for the orthogonal stock cutting problem", Oper Res., Vol. 52, pp.655-71, 2004. https://doi.org/10.1287/opre.1040.0109
  10. Ben Messaoud S, Chu C, and M. Espinouse, "Characterization and modelling of guillotine constraints", Eur J Oper Res., Vol. 191, pp.112-126, 2008. https://doi.org/10.1016/j.ejor.2007.08.029
  11. J. E. Beasley, "An exact two-dimensional non-guillotine cutting tree search procedure", Oper Res., Vol. 33, pp.49- 64, 1985. https://doi.org/10.1287/opre.33.1.49
  12. M. Gradisar, J. Jesenko, and C. Resinovic, "Optimization of roll cutting in clothing industry", Comput. Oper Res., Vol. 24, pp.945-953, 1997. https://doi.org/10.1016/S0305-0548(97)00005-1
  13. A. Abuabara, and R. Morabito, "Cutting optimization of structural tubes to build agricultural light aircrafts", Ann Oper Res., Vol. 169, pp.149-165, 2009. https://doi.org/10.1007/s10479-008-0438-7
  14. S. Koch, S. Konig, and G. Wscher, "Integer linear programming for a cutting problem in the wood-processing industry: a case study", Int Trans Oper Res., Vol. 16, pp.715-726, 2009. https://doi.org/10.1111/j.1475-3995.2009.00704.x
  15. Z. Degraeve, and L. Schrage, "Optimal Integer Solutions to Industrial Cutting Stock Problems", INFORMS J Comput., Vol. 11, pp.406-419, 1999. https://doi.org/10.1287/ijoc.11.4.406
  16. R. D. Tsai, E. M. Malstrom, and H. D. Meeks., "A twodimensional palletizing procedure for warehouse loading operations", IIE Trans., Vol. 20, pp.418-425, 1988. https://doi.org/10.1080/07408178808966200
  17. T. W. Leung, C. H. Yung, and M. D. Troutt, "Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem", Comput. Ind Eng., Vol. 40, pp.201-214, 2001. https://doi.org/10.1016/S0360-8352(01)00021-3
  18. Y. G. G, and M. K. Kang, "A fast algorithm for two-dimensional pallet loading problems of large size", Eur J Oper Res., Vol. 134, pp.193-202, 2001. https://doi.org/10.1016/S0377-2217(00)00249-6
  19. A. Bortfeldt, and T. Winter, "A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces", Int Trans Oper Res., Vol. 16, pp.685-713, 2009. https://doi.org/10.1111/j.1475-3995.2009.00701.x
  20. J. F. Tsai, P. L. Hsieh, and Y. H. Huang, "An optimization algorithm for cutting stock problems in the TFT-LCD industry", Comput. Oper Res., Vol. 57, pp.913-919, 2009.
  21. H. C. LU, and Y. H. Huang, "An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry", Eur J Oper Res., Vol. 246, pp.51- 66, 2015. https://doi.org/10.1016/j.ejor.2015.04.044
  22. J. F. Gonçalves, and M. G. C. Resende, "A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem", Tech Rep., AT&T Labs Research, Florham Park, NJ, 2006.