Heuristic for the rectangular strip packing problem with rotation of items

Sequential heuristic for the two-dimensional bin-packing problem

“…Similarly, larger items are also given priority, because they are difficult to pack. The idea of value correction has been used in solving the onedimensional cutting stock problem (Belov & Scheithauer, 2007) and the strip packing problem (Belov et al, 2008;Cui et al, 2013). …”

“…Initially the item values are equal to their areas. To diversify the cutting plans, the values of the items included in the current pattern are corrected after each pattern being generated based on the size of the items and the material utilization of the pattern, using a formula similar to those in the literature (Belov & Scheithauer, 2007;Belov, Scheithauer, & Mukhacheva, 2008;Cui, Yang, & Chen, 2013). 500 benchmark instances in 50 groups are used to test the performance of the algorithm.…”

Pricing-based primal and dual bounds for selected packing problems

“…Further employments of the SVC heuristic were presented for the twodimensional strip-packing problem by Belov at al. [20] and Cui et al [40] respectively for the orthogonal and non-oriented case, where the latter took into account both the presence and absence of guillotine constraints. 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.…”

A new heuristic algorithm for two-dimensional defective stock guillotine cutting stock problem with multiple stock sizes

“…However, since the 2DCSP and MS2DCSP are NP-hard, the exact algorithm needs more time to find a solution, heuristic algorithms are more popular [13] to solve the large problem instances encountered in practice. Various heuristic algorithms based on different methodologies have been presented for solving these problems, such as Best-fit (BF) method and its enhancement [14,15], Intelligent Search Algorithm and Hybrid Simulated Annealing Algorithm [16,17], Parallel Algorithm [18], Sequential Grouping Heuristic [19,20] and so on.…”