Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns

Chen, Qiulian; Cui, Yaodong; Chen, Yan

doi:10.1080/10556788.2015.1048860

Cited by 6 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, Cui et al [41] inherited the value correction principle for a sequential pattern-set generation algorithm designed to solve one-dimensional CSP with setup costs. In [33] Chen et al exploited the SVC scheme to compute both guillotine and non-guillotine patterns for the two-dimensional BPP. Arbib and Marinelli [12] dealt with the minimization of a convex combination of number of bins and maximum lateness in a one-dimensional BPP integrated with scheduling features, in which orders must be fulfilled within prescribed duedates.…”

Section: Sequential Value Correction Heuristicmentioning

confidence: 99%

Pricing-based primal and dual bounds for selected packing problems

Pizzuti¹

2020

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

Section: Sequential Value Correction Heuristicmentioning

confidence: 99%

Pricing-based primal and dual bounds for selected packing problems

Pizzuti¹

2020

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

“…Chen et al [19] proposed a sequential value correction heuristic for solving the 2DRCSP with constrained threestaged patterns. eir main method was similar to the sequential grouping heuristic proposed in Cui and Zhao [16].…”

mentioning

confidence: 99%

“…e difference was that Chen et al [19] used three-staged homogenous patterns as the element for the cutting plan. Cui and Zhao [16] applied simple block patterns, otherwise.…”

mentioning

confidence: 99%

“…A planimprovement procedure is also used to generate an improved solution. eir heuristic algorithm was also the same as the sequential value correction heuristic presented in Chen et al [19].…”

mentioning

confidence: 99%

“…e third optimization method is the heuristic procedure, whose main thought is to generate a cutting pattern using the remaining items with some pattern-generation algorithm repeatedly until all items demand is fulfilled. Based on [7,15,19,21,23], the computational complexity is moderate with large item type. e runtime of solving all instances is in a short time.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

Yang

2021

Advances in Materials Science and Engineering

View full text Add to dashboard Cite

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.

show abstract