A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

Abstract

This work presents a tailored branch‐and‐cut algorithm for the two‐dimensional irregular strip packing problem with uncertain demand for the items to be cut. A two‐stage stochastic programming model is developed, considering a discrete and finite set of scenarios. The strip is discretized over a mesh of points in the model and includes constraints to ensure items are non‐overlapping based on the concepts of inner‐fit raster and no‐fit raster. The algorithm considers lower and upper bounds from a heuristic based on the variable neighborhood search. This heuristic is also used during optimization to obtain new solutions and help to prune unsatisfactory nodes. The numerical results indicate the effectiveness of the proposed algorithm when observing other exact algorithms on the same problem without uncertainty. The algorithm can also provide optimal solutions for instances with uncertainty having more than 60 scenarios within some hours of execution. Besides, the conclusions show it is preferable to handle uncertainty to achieve minimum cost decisions.

Optimization of a Rural Portfolio Credit Granting System Using Improved Two-Dimensional Strip Packing Grouping Delay Problem

“…The test parameters are the lag limit (LL), number of groups (g), number of each group (m k ), and the maximum range of width and height (L p ). Their parameter ranges are [0.6,1], [2,10], [10,20] and [2,8], respectively.…”

“…Qi et al [9] studied the relationship between the lower left coordinates of the rectangles and strip boxes and established linear integer programming models of nonrotating and rotating two-dimensional rectangular strip boxes to ensure that the two rectangles would not be placed repeatedly. Queiroz [10] presented a tailored branch-and-cut algorithm for the two-dimensional irregular strip packing problem with uncertain demand for the items to be cut. A two-stage stochastic programming model is developed, considering a discrete and finite set of scenarios.…”

Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups

“…Knapsack problems (KP) can be encountered in plenty of real‐world applications: cutting and packing (Hifi, 2004; Oliveira et al., 2023; de Souza Queiroz and Andretta, 2022), multimedia (Akbar et al., 2006), cryptography (Merkle and Hellman, 1978), logistics (Perboli et al., 2014), telecommunications, and resource allocation (Plata‐Gonzalez et al., 2019). This type of problem can play a central role in modeling various complex combinatorial optimization problems, where the considered models can be used as a driving strategy for the design of powerful exact and approximate algorithms.…”

A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows

“…For example, a huge number of calls of the packing algorithm are required in branch‐and‐price‐based algorithms, which is usually time‐consuming. Although some exact algorithms have been developed to efficiently solve midscale instances of two‐dimensional bin packing problems, such as branch‐and‐bound (Clautiaux et al., 2007; Côté et al., 2014) and branch‐and‐cut (Souza Queiroz and Andretta, 2022), it is difficult to handle large‐scale instances. Thus, heuristic packing algorithms have been widely used in the scheduling problems with two‐dimensional bin packing constraints, such as VRP with loading constraints (Pollaris et al., 2015; Wei et al., 2018), lock scheduling problem (Ji et al., 2019), and berth allocation problem (Tang et al., 2022).…”