A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity

The common staged patterns are always required during the cutting process for separating a set of rectangular items from rectangular plates in manufacturing industries. Two-staged patterns can reduce cutting complexity at the expense of material utilization; three-staged patterns do the opposite. Co...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Dianjian Wu, Guangyou Yang
Formato: article
Lenguaje:EN
Publicado: Hindawi Limited 2021
Materias:
Acceso en línea:https://doaj.org/article/7575f413cec044d4ba241a60537d8eee
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:7575f413cec044d4ba241a60537d8eee
record_format dspace
spelling oai:doaj.org-article:7575f413cec044d4ba241a60537d8eee2021-11-22T01:10:10ZA Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity1687-844210.1155/2021/3732720https://doaj.org/article/7575f413cec044d4ba241a60537d8eee2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/3732720https://doaj.org/toc/1687-8442The common staged patterns are always required during the cutting process for separating a set of rectangular items from rectangular plates in manufacturing industries. Two-staged patterns can reduce cutting complexity at the expense of material utilization; three-staged patterns do the opposite. Combining these two types of staged patterns may be a good balance for two contradictory objectives of material utilization and cutting complexity. A heuristic approach is proposed to solve the two-dimensional rectangular cutting stock problem with a combination of two-staged general patterns (2SGP) and three-staged homogenous patterns (3SHP). Firstly, the 2SGP and 3SHP are constructed by using recursive techniques. The pattern with the larger value is selected as the candidate pattern. Then, the value of each item is corrected according to the current candidate pattern. A cutting plan accurately satisfying all items demand is obtained by using the sequential heuristic algorithm. Finally, the cutting plan with a minimum number of used plates is achieved by applying the iterative algorithm. The computational results indicate that the proposed heuristic approach is more effective in material utilization and cutting complexity than the two published algorithms with staged patterns.Dianjian WuGuangyou YangHindawi LimitedarticleMaterials of engineering and construction. Mechanics of materialsTA401-492ENAdvances in Materials Science and Engineering, Vol 2021 (2021)
institution DOAJ
collection DOAJ
language EN
topic Materials of engineering and construction. Mechanics of materials
TA401-492
spellingShingle Materials of engineering and construction. Mechanics of materials
TA401-492
Dianjian Wu
Guangyou Yang
A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
description The common staged patterns are always required during the cutting process for separating a set of rectangular items from rectangular plates in manufacturing industries. Two-staged patterns can reduce cutting complexity at the expense of material utilization; three-staged patterns do the opposite. Combining these two types of staged patterns may be a good balance for two contradictory objectives of material utilization and cutting complexity. A heuristic approach is proposed to solve the two-dimensional rectangular cutting stock problem with a combination of two-staged general patterns (2SGP) and three-staged homogenous patterns (3SHP). Firstly, the 2SGP and 3SHP are constructed by using recursive techniques. The pattern with the larger value is selected as the candidate pattern. Then, the value of each item is corrected according to the current candidate pattern. A cutting plan accurately satisfying all items demand is obtained by using the sequential heuristic algorithm. Finally, the cutting plan with a minimum number of used plates is achieved by applying the iterative algorithm. The computational results indicate that the proposed heuristic approach is more effective in material utilization and cutting complexity than the two published algorithms with staged patterns.
format article
author Dianjian Wu
Guangyou Yang
author_facet Dianjian Wu
Guangyou Yang
author_sort Dianjian Wu
title A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
title_short A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
title_full A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
title_fullStr A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
title_full_unstemmed A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity
title_sort heuristic approach for two-dimensional rectangular cutting stock problem considering balance for material utilization and cutting complexity
publisher Hindawi Limited
publishDate 2021
url https://doaj.org/article/7575f413cec044d4ba241a60537d8eee
work_keys_str_mv AT dianjianwu aheuristicapproachfortwodimensionalrectangularcuttingstockproblemconsideringbalanceformaterialutilizationandcuttingcomplexity
AT guangyouyang aheuristicapproachfortwodimensionalrectangularcuttingstockproblemconsideringbalanceformaterialutilizationandcuttingcomplexity
AT dianjianwu heuristicapproachfortwodimensionalrectangularcuttingstockproblemconsideringbalanceformaterialutilizationandcuttingcomplexity
AT guangyouyang heuristicapproachfortwodimensionalrectangularcuttingstockproblemconsideringbalanceformaterialutilizationandcuttingcomplexity
_version_ 1718418346137878528