Genetic Algorithm Approach for Cutting Stock Problems in Construction Industries

Bambang Santoso; Heri Haerudin

doi:10.55927/ijis.v2i7.4810

Authors

Bambang Santoso Universitas Pamulang
Heri Haerudin Universitas Pamulang

DOI:

https://doi.org/10.55927/ijis.v2i7.4810

Keywords:

Cutting Stock Problem, Genetic Algorithm, Reinforced Concrete, Constructions

Abstract

Cutting Stock Problem (CSP) is a classic problem involving cutting long stocks into smaller products with certain quantities. The optimization is to find cutting patterns with minimum waste. In construction industries, CSP applies to steel bar cutting. The steel bar is an important element in making reinforced concrete. The length of the steel bars from the steel manufacturers is fixed, while the requirements for the constructions are varying. The problem is to find optimized way to cut long, fixed-length steel bars into smaller, varying length bars required in the constructions. The requirements are different from building to building, both in the lengths and quantities. Many studies have been extensively done on the subject, from Brute Force, Greedy Search to Linear Programming. In this paper the study focuses on Genetic Algorithm approach. The results look promising for Fitness Function 1 where the focus is to minimize waste. Waste ranges from 2.03% to 4.31%. Fitness function 2 and 3 do not emphasize merely on minimizing the waste, but also on contiguity. Therefore the residues are more, ranges from 2.21% to 4.91% for Fitness Function 2 and from 2.03% to 30.7% for Fitness Function 3

Downloads

Download data is not yet available.

References

Abuhassan, I. A. O., & Nasereddin, H. H. O. (2011). Cutting Stock Problem : Solution Behaviors. International Journal of Recent Research and Applied Studies,6(March),429–433.

https://www.researchgate.net/publication/281120697_CUTTING_STOCK_PROBLEM_SOLUTION_BEHAVIORS

Amjad, M. K., Butt, S. I., Kousar, R., Ahmad, R., Agha, M. H., Faping, Z., Anjum, N., & Asgher, U. (2018). Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. Mathematical Problems in Engineering, 2018. https://doi.org/10.1155/2018/9270802

Delorme, M. (2017). Mathematical models and decomposition algorithms for cutting and packing problems. Dottorato Di Ricerca in Automatica e Ricerca Operativa Ciclo. https://doi.org/10.1007/s10288-017-0365-z

Feo, T. A., & Resende, M. G. C. (1995). Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6(2), 109–133. https://doi.org/10.1007/BF01096763

Kenneth H. Rosen. (2007). Discrete Mathematics and Its Applications. In Mc Graw Hill (6thed.) .Mc Graw Hill. https://doi.org/10.13109/9783666538452.10

Kokten, E. S., & Sel, Ç. (2022). A cutting stock problem in the wood products industry: a two-stage solution approach. International Transactions in Operational Research, 29(2), 879–907. https://doi.org/10.1111/itor.12802

Kumar, D. (2015). Comparative Study of Genetic Algorithm Performed in a Single Generation for two Different Fitness Functions Technique f(x) = x^2 and f(x) = x^2+1. International Journal of Computer Applications, 128(17), 7–15. https://doi.org/10.5120/ijca2015906572

Lazar, M., & Zuazua, E. (2022). Greedy Search Of Optimal Approximate Solutions.

Mitchell, M. (1999). An Introduction to Genetic Algorithms. In A Bradford Book The MIT Press. A Bradford Book The MIT Press. https://doi.org/10.1162/artl.1997.3.63

Ogunranti, G. A., & Oluleye, A. E. (2016). Minimizing waste (off-cuts) using cutting stock model: The case of one dimensional cutting stock problem in wood working industry. Journal of Industrial Engineering and Management, 9(3), 834–859. https://doi.org/10.3926/jiem.1653

Pierini, L. M., & Poldi, K. C. (2021). Lot sizing and cutting stock problems in a paper production process. Pesquisa Operacional, 41(Special issue). https://doi.org/10.1590/0101-7438.2021.041s1.00235094

Porumbel, D. (2022). Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. INFORMS Journal on Computing, 34(5), 2736–2753. https://doi.org/10.1287/ijoc.2022.1160

Santoso, B., Prasetiyo, S. M., & Wijoyo, A. (2019). Meminimalkan Sisa Pemotongan Besi Beton dalam Proyek Konstruksi. Jurnal Informatika UniversitasPamulang,4(2),73. https://doi.org/10.32493/informatika.v4i2.3204

Saxena, A. (2016). Review of Crossover Techniques for Genetic Algorithms. International Journal of Trend in Research and Development, 3(5), 347–349.

Yan Chen, Xiang Song, Djamila Ouelhadj, Y. C. (2017). A heuristic for the skiving and cutting stock problem in paper and plastic film industries. International Transactions in Operational Research, 26(1), 157–179.