Skip to main content
SpringerLink
Log in

Cutting Stock Problem with the IoT

  • Chapter
  • First Online:
Optimization and Management in Manufacturing Engineering

Part of the book series: Springer Optimization and Its Applications ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44, 145–159 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366–422 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 91, 849–859 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem-part II. Oper. Res. 11, 863–888 (1963)

    Article  MATH  Google Scholar 

  5. Stadtler, H.: A one-dimensional cutting stock problem in the aluminium industry and its solution. Eur. J. Oper. Res. 44, 209–223 (1990)

    Article  MATH  Google Scholar 

  6. Degraeve, Z., Peeters, M.: Optimal integer solutions to industrial cutting-stock problems: part 2, Benchmark results. INFORMS J. Comput. 15, 58–81 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee, J.: In situ column generation for a cutting-stock problem. Comput. Oper. Res. 34, 2345–2358 (2007)

    Article  MATH  Google Scholar 

  8. Vance, P.: Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9, 211–228 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Program. Ser. A. 86, 565–594 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yanasse, H.H., Lamosa, J.P.: An integrated cutting stock and sequencing problem. Eur. J. Oper. Res. 183, 1353–1370 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Haessler, R.W.: Controlling cutting pattern changes in one-dimensional trim problems. Oper. Res. 23, 483–493 (1975)

    Article  MATH  Google Scholar 

  13. Sweeney, E., Haessler, R.W.: One-dimensional cutting stock decisions for rolls with multiple quality grades. Eur. J. Oper. Res. 44, 224–231 (1990)

    Article  MATH  Google Scholar 

  14. 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)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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)

    Article  MATH  Google Scholar 

  16. 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. 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)

    Article  MATH  Google Scholar 

  18. Chu, C.B., Antonio, J.: Approximation algorithms to solve real-life multicriteria cutting stock problems. Oper. Res. 47(4), 495–508 (1999)

    Article  MATH  Google Scholar 

  19. Vahrenkamp, R.: Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. 95, 191–200 (1996)

    Article  MATH  Google Scholar 

  20. Wagner, B.J.: A genetic algorithm solution for one-dimensional bundled stock cutting. Eur. J. Oper. Res. 117, 368–381 (1999)

    Article  MATH  Google Scholar 

  21. 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)

    Article  MathSciNet  Google Scholar 

  22. 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)

    Article  Google Scholar 

  23. 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)

    Article  Google Scholar 

  24. 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. Matsumoto, K., Umetani, S., Nagamochi, H.: On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14, 281–290 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  26. 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. Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25, 31–44 (1977)

    Article  MATH  Google Scholar 

  28. 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)

    Article  MATH  Google Scholar 

  29. Lindecrantz, N.: Method for optimum cutting of rectangular sheets. BIT Numer. Math. 4(1), 30–35 (1964)

    Article  Google Scholar 

  30. Gilmore, P., Gomory, R.: Multistage cutting problems of two and more dimensions. Oper. Res. 13, 94–119 (1965)

    Article  MATH  Google Scholar 

  31. Tarnowski, A.G., Terno, J., Scheithauer, G.: A polynomial time algorithm for the guillotine pallet loading problem. INFOR. 32, 275–287 (1994)

    MATH  Google Scholar 

  32. Cui, Y.D.: Dynamic programming algorithms for the optimal cutting of equal rectangles. Appl. Math. Model. 29, 1040–1053 (2005)

    Article  MATH  Google Scholar 

  33. Dagli, C.H.: Knowledge-based systems for cutting stock problems. Eur. J. Oper. Res. 44, 160–166 (1990)

    Article  MATH  Google Scholar 

  34. Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)

    Article  Google Scholar 

  35. 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)

    Article  Google Scholar 

  36. 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)

    Article  MATH  Google Scholar 

  37. 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)

    Article  MATH  Google Scholar 

  38. Weng, W.-C., Kuo, H.-C.: Irregular stock cutting system based on AutoCAD. Adv. Eng. Softw. 42, 634–643 (2011)

    Article  MATH  Google Scholar 

  39. Cui, Y., Xu, D.-y.: Strips minimization in two-dimensional cutting stock of circular items. Comput. Oper. Res. 37, 621–629 (2010)

    Article  MATH  Google Scholar 

  40. 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 

Download references

Author information

Authors and Affiliations

  1. School of Management, Hefei University of Technology, Hefei, China

    Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng & Mi Zhou

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Authors
  1. Xinbao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hao Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mi Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Liu, X., Pei, J., Liu, L., Cheng, H., Zhou, M., Pardalos, P.M. (2017). Cutting Stock Problem with the IoT. In: Optimization and Management in Manufacturing Engineering. Springer Optimization and Its Applications, vol 126. Springer, Cham. https://doi.org/10.1007/978-3-319-64568-1_5

Download citation

Publish with us

Policies and ethics

Search

Navigation