Models for the two-dimensional level strip packing problem – a review and a computational evaluation

Bezerra, Vanessa M. R.; Leão, Aline Aparecida de Souza; Oliveira, Jonice; Santos, Maristela Oliveira dos

doi:10.1080/01605682.2019.1578914

Cited by 21 publications

(9 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, in the last two years, Bezerra et al [10] proposed a survey on a special case of the 2D-SPP, while Iori et al [26] reviewed exact algorithms for two-dimensional cutting and packing problems.…”

Section: Surveys and Typologiesmentioning

confidence: 99%

“…Each class includes instances of different sizes, namely it has 10 instances for each value of the number of items in {20, 40, 60, 80, 100}. The bins are identical for all instances in each class, and they vary from (10,10) in class 1 to (300, 300) in class 6; • A: 43 instances introduced by Macedo et al [33] for the 2D-CSP with guillotine cuts. In these instances, that are derived from the furniture industry, the number of items ranges between 13 and 809 and the bins are either (2750, 1220), (2550, 2100), or (2470, 2080).…”

Section: Benchmarks Proposed For the 2d-bpp And 2d-cspmentioning

confidence: 99%

See 1 more Smart Citation

2DPackLib: a two-dimensional cutting and packing library

et al. 2021

View full text Add to dashboard Cite

Two-dimensional cutting and packing problems model a large number of relevant industrial applications.The literature on practical algorithms for such problems is very large. We introduce the , a library on two-dimensional orthogonal cutting and packing problems. The library makes available, in a unified format, 25 benchmarks from the literature for a total of over 3000 instances, provides direct links to surveys and typologies, and includes a list of relevant links.

show abstract

Section: Surveys and Typologiesmentioning

confidence: 99%

Section: Benchmarks Proposed For the 2d-bpp And 2d-cspmentioning

confidence: 99%

2DPackLib: a two-dimensional cutting and packing library

et al. 2021

View full text Add to dashboard Cite

show abstract

“…However, the cutting problem in this article does not consider vertical guillotine cutting [17]; therefore, the cutting angle needs to be considered. The long fish body shown in Figure 1a can be simplified into a rhombus-like body along the viewing direction, as shown in Figure 5.…”

Section: Determination Of Errorwmentioning

confidence: 99%

Research on Fish Slicing Method Based on Simulated Annealing Algorithm

2021

View full text Add to dashboard Cite

Multiobjective optimization is a common problem in the field of industrial cutting. In actual production settings, it is necessary to rely on the experience of skilled workers to achieve multiobjective collaborative optimization. The process of industrial intelligence is to perceive the parameters of a cut object through sensors and use machines instead of manual decision making. However, the traditional sequential algorithm cannot satisfy multiobjective optimization problems. This paper studies the multiobjective optimization problem of irregular objects in the field of aquatic product processing and uses the information guidance strategy to develop a simulated annealing algorithm to solve the problem according to the characteristics of the object itself. By optimizing the mutation strategy, the ability of the simulated annealing algorithm to jump out of the local optimal solution is improved. The project team developed an experimental prototype to verify the algorithm. The experimental results show that compared with the traditional sequential algorithm method, the simulated degradation algorithm designed in this paper effectively improves the quality of the target solution and greatly enhances the economic value of the product by addressing the multiobjective optimization problem of squid cutting. At the end of the article, the cutting error is analyzed.

show abstract

“…Experiments have shown the algorithm was superior to the existing branch-and-bound method. Vanessa [5] et al proposed the use of two mixed integer linear programming model. The results show that the model can produce more optimal solutions.…”

Section: B Previous Workmentioning

confidence: 99%

Hybrid Heuristic Algorithm Based On Improved Rules & Reinforcement Learning for 2D Strip Packing Problem

Zhu

2020

IEEE Access

View full text Add to dashboard Cite

Models for the two-dimensional level strip packing problem – a review and a computational evaluation

Cited by 21 publications

References 51 publications

2DPackLib: a two-dimensional cutting and packing library

2DPackLib: a two-dimensional cutting and packing library

Research on Fish Slicing Method Based on Simulated Annealing Algorithm

Hybrid Heuristic Algorithm Based On Improved Rules & Reinforcement Learning for 2D Strip Packing Problem

Contact Info

Product

Resources

About