Sequential heuristic for the two-dimensional bin-packing problem

Cui, Yi-Ping; Cui, Yaodong; Tang, Tianbing

doi:10.1016/j.ejor.2014.06.032

Cited by 30 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The following algorithms that use nonstaged patterns are compared with HHBP, where nonstaged means that the constraint on the number of stages is not considered in generating the patterns: A‐B the agent‐based heuristic from Polyakovsky and M'Hallah (); CHBP the constructive heuristic with bias and postprocessing from Charalambous and Fleszar (); CFIHJ4 the best insertion heuristic in Fleszar (); SVCRG the algorithm in Cui et al. ().…”

Section: Computational Resultsmentioning

confidence: 99%

Hybrid approach for the two‐dimensional bin packing problem with two‐staged patterns

Cui

Yao

Cui

2015

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

This paper presents a two‐phase heuristic approach for the two‐dimensional bin packing problem with two‐staged patterns and nonoriented items. A solution is generated in each phase and the better one is selected. Residual problems are solved by column generation in the first phase, where a partial admitting procedure is used to admit some of the patterns into the phase‐1 solution. The second solution is obtained from solving an integer linear programming problem over the set of all patterns generated in the first phase, where a time limit is used and subsequently the solution may not be optimal over the pattern set. The computational results indicate that the approach yields the best solution quality among the heuristics that use two‐staged or more complex patterns.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Hybrid approach for the two‐dimensional bin packing problem with two‐staged patterns

Cui

Yao

Cui

2015

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…SVC procedures have been widely used in the literature to solve cutting and packing problems (Song et al., ; Belov et al., ; Cui et al., ). We propose an SVC procedure and combine it with the DSCSP model to solve the DSCSP.…”

Section: Dscsp Optimization Model and Solution Methodsmentioning

confidence: 99%

A heuristic for the skiving and cutting stock problem in paper and plastic film industries

Chen

Song

Ouelhadj

et al. 2017

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

This paper investigates the skiving and cutting stock problem (SCSP) encountered in the paper and plastic film industries, in which a set of nonstandard reels generated from previous cutting processes are used to produce finished rolls through the skiving and cutting process. First, reels are skived together lengthwise to form a reel-pyramid (a polygon), and then the reel-pyramid is cut into finished rolls of small widths. Depending on if a reel can be divided lengthwise into subreels to form the reel-pyramid, the problem can be classified into divisible SCSP (DSCSP) and indivisible SCSP (ISCSP). In this paper, two integer programming (IP) models are proposed for DSCSP and ISCSP, respectively. A sequential value correction procedure combined with the two IP models (SVCTIP) is developed to solve the two SCSPs. The effectiveness of the SVCTIP is demonstrated through extensive computational tests.

show abstract

“…Our implementation (here named SVC-DD and described in Algorithm 2) differs from those proposed in [20,42], mainly in how bins are filled and pseudo-prices updated. Moreover, in our case the output is a set of reciprocally non-dominated solutions in terms of the number N of bins filled and the maximum lateness L max .…”

Section: A Sequential Value Correction Heuristicmentioning

confidence: 99%