Applying triple-block patterns in solving the two-dimensional bin packing problem

Cui, Yi-Ping; Yao, Yi‐Ching; Zhang, Defu

doi:10.1057/s41274-016-0148-5

Cited by 7 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Cui et al. () proposed the triple block cutting schemes. They differ from the single block schemes because a full single block scheme is built on the bottom‐left corner of the whole stock sheet instead of extracting just one piece.…”

Section: C2dc Solving Approaches and Literature Reviewmentioning

confidence: 99%

“…Contrary to Chen (2008), homogeneous strips of equivalent pieces are considered instead of single pieces, as previously described in Section 2.1. Recently, Cui et al (2018) proposed the triple block cutting schemes. They differ from the single block schemes because a full single block scheme is built on the bottom-left corner of the whole stock sheet instead of extracting just one piece.…”

Section: Heuristic and Metaheuristic Approachesmentioning

confidence: 99%

“…Hence, only guillotine orthogonal cuts are allowed, that is, cuts parallel to the sheet borders that dissect a rectangle in two parts by traversing it from one end to the other. In the nonguillotine variant, also referred to as free cuts , this requirement is relaxed and each cut starts from an edge and may stop also in the middle of the sheet (Wäscher et al., 2007; Cui et al., ).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

Russo¹,

Boccia

Sforza³

et al. 2019

Int Trans Operational Res

View full text Add to dashboard Cite

In the two‐dimensional (2D) cutting (2DC) problem, a large rectangular sheet has to be dissected into smaller rectangular pieces with the aim of maximizing the total profit associated with the extracted pieces. When the number of copies of each piece to be extracted is bounded, it is referred to as constrained 2DC (C2DC) problem. The C2DC has been widely studied by the operations research community for its applications and theoretical issues. In this work, we recall the best exact and heuristic solving approaches for the C2DC and we provide a review and a categorization of the available upper bounds. We also discuss improvements and combinations of these upper bounds and give directions for their effective exploitation. Finally, we demonstrate the loss of accuracy of several exact methods present in literature because of the effect of the used antiredundancy strategies on the implemented bounding criteria. This work, based on more than 90 contributions, has a twofold target. For researchers working in C2DC, it provides a useful insight on the topic. For expert practitioners, it represents a systematic collection of the main findings and achievements, posing also the basis for future research.

show abstract

Section: C2dc Solving Approaches and Literature Reviewmentioning

confidence: 99%

Section: Heuristic and Metaheuristic Approachesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

Russo¹,

Boccia

Sforza³

et al. 2019

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Cui et al [21] proposed a heuristic algorithm for the 2DRCSP with guillotine cutting. eir algorithm included three procedures.…”

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%

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

A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function

2023

View full text Add to dashboard Cite

Applying triple-block patterns in solving the two-dimensional bin packing problem

Cited by 7 publications

References 28 publications

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

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

A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function

Contact Info

Product

Resources

About