Cutting Stock Problem with the IoT

  • Xinbao Liu
  • Jun Pei
  • Lin Liu
  • Hao Cheng
  • Mi Zhou
  • Panos M. Pardalos
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 126)

Abstract

The cutting stock problem is representative of the combinatorial optimization problems that arise in industries such as steel, furniture, paper, glass, and leather. In a cutting plan, we must obtain the required set of smaller pieces (items) by cutting large pieces (objects) that are in stock. The objective is usually to minimize waste. In a real-life cutting process, there are some further criteria, e.g., the number of different cutting patterns (setups), capacity of the cutting equipment, and due dates. With the increasing scarcity of resources in the world, researchers are paying more attention to resource utilization.

References

  1. 167.
    Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44, 145–159 (1990)MathSciNetCrossRefMATHGoogle Scholar
  2. 168.
    Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366–422 (1960)MathSciNetCrossRefMATHGoogle Scholar
  3. 169.
    Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 91, 849–859 (1961)MathSciNetCrossRefMATHGoogle Scholar
  4. 170.
    Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem-part II. Oper. Res. 11, 863–888 (1963)CrossRefMATHGoogle Scholar
  5. 171.
    Stadtler, H.: A one-dimensional cutting stock problem in the aluminium industry and its solution. Eur. J. Oper. Res. 44, 209–223 (1990)CrossRefMATHGoogle Scholar
  6. 172.
    Degraeve, Z., Peeters, M.: Optimal integer solutions to industrial cutting-stock problems: part 2, Benchmark results. INFORMS J. Comput. 15, 58–81 (2003)MathSciNetCrossRefMATHGoogle Scholar
  7. 173.
    Lee, J.: In situ column generation for a cutting-stock problem. Comput. Oper. Res. 34, 2345–2358 (2007)CrossRefMATHGoogle Scholar
  8. 174.
    Vance, P.: Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9, 211–228 (1998)MathSciNetCrossRefMATHGoogle Scholar
  9. 175.
    Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Program. Ser. A. 86, 565–594 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 176.
    Peeters, M., Degraeve, Z.: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. Eur. J. Oper. Res. 170, 416–439 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 177.
    Yanasse, H.H., Lamosa, J.P.: An integrated cutting stock and sequencing problem. Eur. J. Oper. Res. 183, 1353–1370 (2007)MathSciNetCrossRefMATHGoogle Scholar
  12. 178.
    Haessler, R.W.: Controlling cutting pattern changes in one-dimensional trim problems. Oper. Res. 23, 483–493 (1975)CrossRefMATHGoogle Scholar
  13. 179.
    Sweeney, E., Haessler, R.W.: One-dimensional cutting stock decisions for rolls with multiple quality grades. Eur. J. Oper. Res. 44, 224–231 (1990)CrossRefMATHGoogle Scholar
  14. 180.
    Gradisar, M., Trkman, P.: A combined approach to the solution to the general one-dimensional cutting stock problem. Comput. Oper. Res. 32, 1793–1807 (2005)MathSciNetCrossRefMATHGoogle Scholar
  15. 181.
    Scholl, A., Klein, R., Jurgens, C.: BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627–645 (1997)CrossRefMATHGoogle Scholar
  16. 182.
    Sung, T.-C., Weng, W.-C., Yang, C.-T.: A two-stage optimization of piece arrangement for the cutting problem in shipbuilding. J. Mar. Sci. Technol. 12(3), 175–182 (2004)Google Scholar
  17. 183.
    Antonio, J., Chauvet, F., Chu, C.B., Proth, J.M.: The cutting stock problem with mixed objectives: two heuristics based on dynamic programming. Eur. J. Oper. Res. 114, 395–402 (1999)CrossRefMATHGoogle Scholar
  18. 184.
    Chu, C.B., Antonio, J.: Approximation algorithms to solve real-life multicriteria cutting stock problems. Oper. Res. 47(4), 495–508 (1999)CrossRefMATHGoogle Scholar
  19. 185.
    Vahrenkamp, R.: Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. 95, 191–200 (1996)CrossRefMATHGoogle Scholar
  20. 186.
    Wagner, B.J.: A genetic algorithm solution for one-dimensional bundled stock cutting. Eur. J. Oper. Res. 117, 368–381 (1999)CrossRefMATHGoogle Scholar
  21. 187.
    Liang, K.H., Yao, X., Newton, Y., Hoffman, D.: A new evolutionary approach to cutting stock problems with and without contiguity. Comput. Oper. Res. 29(12), 1641–1659 (2002)MathSciNetCrossRefGoogle Scholar
  22. 188.
    Yang, C.-T., Sung, T.-C., Weng, W.-C.: An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems. Adv. Eng. Softw. 37(8), 502–513 (2006)CrossRefGoogle Scholar
  23. 189.
    Gracia, C., Andrés, C., Gracia, L.: A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company. J. Heuristics. 19, 253–273 (2013)CrossRefGoogle Scholar
  24. 190.
    Yang, B., Li, C., Huang L., Tan, Y., Zhou, C.: Solving one-dimensional cutting-stock problem based on ant colony optimization. Fifth International Joint Conference on INC, IMS and IDC (2009)Google Scholar
  25. 191.
    Matsumoto, K., Umetani, S., Nagamochi, H.: On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14, 281–290 (2011)MathSciNetCrossRefMATHGoogle Scholar
  26. 192.
    Vacharapoom, B., Sdhabhon, B.: Three-step solutions for cutting stock problem of construction steel bars. J. Civ. Eng. 5, 1239–1247 (2014)Google Scholar
  27. 193.
    Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25, 31–44 (1977)CrossRefMATHGoogle Scholar
  28. 194.
    Agrawal, P.K.: Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts. Eur. J. Oper. Res. 64, 410–422 (1993)CrossRefMATHGoogle Scholar
  29. 195.
    Lindecrantz, N.: Method for optimum cutting of rectangular sheets. BIT Numer. Math. 4(1), 30–35 (1964)CrossRefGoogle Scholar
  30. 196.
    Gilmore, P., Gomory, R.: Multistage cutting problems of two and more dimensions. Oper. Res. 13, 94–119 (1965)CrossRefMATHGoogle Scholar
  31. 197.
    Tarnowski, A.G., Terno, J., Scheithauer, G.: A polynomial time algorithm for the guillotine pallet loading problem. INFOR. 32, 275–287 (1994)MATHGoogle Scholar
  32. 198.
    Cui, Y.D.: Dynamic programming algorithms for the optimal cutting of equal rectangles. Appl. Math. Model. 29, 1040–1053 (2005)CrossRefMATHGoogle Scholar
  33. 199.
    Dagli, C.H.: Knowledge-based systems for cutting stock problems. Eur. J. Oper. Res. 44, 160–166 (1990)CrossRefMATHGoogle Scholar
  34. 200.
    Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)CrossRefGoogle Scholar
  35. 201.
    Leng, T.W., Yung, C.H., Troutt, M.D.: Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput. Ind. Eng. 40, 201–214 (2001)CrossRefGoogle Scholar
  36. 202.
    Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171, 811–829 (2006)CrossRefMATHGoogle Scholar
  37. 203.
    Silva, E., Alvelos, F., Valério de Carvalho, J.M.: An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur. J. Oper. Res. 205, 699–708 (2010)CrossRefMATHGoogle Scholar
  38. 204.
    Weng, W.-C., Kuo, H.-C.: Irregular stock cutting system based on AutoCAD. Adv. Eng. Softw. 42, 634–643 (2011)CrossRefMATHGoogle Scholar
  39. 205.
    Cui, Y., Xu, D.-y.: Strips minimization in two-dimensional cutting stock of circular items. Comput. Oper. Res. 37, 621–629 (2010)CrossRefMATHGoogle Scholar
  40. 206.
    Lin, L., Liu, X., Pei, J., Fan, W., Pardalos, P.M.: A study on decision making of cutting stock with frustum of cone bars. Oper. Res. 12, 1–18 (2015)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Xinbao Liu
    • 1
  • Jun Pei
    • 1
  • Lin Liu
    • 1
  • Hao Cheng
    • 1
  • Mi Zhou
    • 1
  • Panos M. Pardalos
    • 2
  1. 1.School of ManagementHefei University of TechnologyHefeiChina
  2. 2.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations