scholarly journals SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects

2014 ◽  
Vol 23 (1-2) ◽  
pp. 173-186 ◽  
Author(s):  
Vera Neidlein ◽  
André Scholz ◽  
Gerhard Wäscher
Keyword(s):  
Two Dimensional ◽  
Large Object ◽  
Placement Problem ◽  
Problem Generator

An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem

2008 ◽  
Vol 23 (3) ◽  
pp. 375-393
Author(s):  
Y. Cui ◽  
T. Gu ◽  
W. Hu
Keyword(s):  
Two Dimensional ◽  
Large Object ◽  
Placement Problem

A hybrid genetic algorithm for the two-dimensional single large object placement problem

2007 ◽  
Vol 183 (3) ◽  
pp. 1150-1166 ◽  
Author(s):  
Eleni Hadjiconstantinou ◽  
Manuel Iori
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Two Dimensional ◽  
Large Object ◽  
Placement Problem

scholarly journals A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints

2020 ◽  
Vol 124 ◽  
pp. 105058
Author(s):  
E.F. da Silva ◽  
A.A.S. Leão ◽  
F.M.B. Toledo ◽  
T. Wauters
Keyword(s):  
Three Dimensional ◽  
Large Object ◽  
Placement Problem ◽  
Practical Constraints

2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems

2014 ◽  
Vol 237 (3) ◽  
pp. 846-856 ◽  
Author(s):  
Elsa Silva ◽  
José F. Oliveira ◽  
Gerhard Wäscher
Keyword(s):  
Two Dimensional ◽  
Cutting And Packing ◽  
Packing Problems ◽  
Problem Generator

scholarly journals Metaheuristic Solution Approach for Two-Dimensional Palette Placement Problem

2019 ◽  
pp. 79-90
Author(s):  
İrem Ünal ◽  
Hakan Görgün ◽  
Serol Bulkan
Keyword(s):  
Two Dimensional ◽  
Placement Problem ◽  
Solution Approach

Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

2019 ◽  
Vol 27 (2) ◽  
pp. 767-793 ◽  
Author(s):  
Mateus Martin ◽  
Ernesto G. Birgin ◽  
Rafael D. Lobato ◽  
Reinaldo Morabito ◽  
Pedro Munari
Keyword(s):  
Two Dimensional ◽  
Placement Problem ◽  
Guillotine Cuts

A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem

2020 ◽  
Vol 115 ◽  
pp. 104851 ◽  
Author(s):  
Mateus Martin ◽  
Reinaldo Morabito ◽  
Pedro Munari
Keyword(s):  
Two Dimensional ◽  
Placement Problem ◽  
Bottom Up

scholarly journals Exact fit problem generator for cutting and packing, revisiting of the upper deck placement algorithm

2018 ◽  
Vol 10 (1) ◽  
pp. 73-85
Author(s):  
Levente Filep ◽  
László Illyés
Keyword(s):  
Exact Solution ◽  
Collision Detection ◽  
Cutting And Packing ◽  
Large Object ◽  
Upper Deck ◽  
Large Rectangle ◽  
Area Problem ◽  
Placement Algorithm ◽  
Generator Output ◽  
Problem Generator

Abstract Problem generators are practical solutions for generating a set of inputs to specific problems. These inputs are widely used for testing, comparing and optimizing placement algorithms. The problem generator presented in this paper fills the gap in the area of 2D Cutting & Packing as the sum of the area of the small objects is equal to the area of the Large Object and has at least one perfect solution. In this paper, the already proposed Upper Deck algorithm is revisited and used to test the proposed generator outputs. This algorithm bypasses the dead area problem that occurs in most of all well-known strategies of the 2D Single Knapsack Problem where we have a single large rectangle to cover with small, heterogeneous rectangle shapes, whom total area exceeds the large object’s area. The idea of placing the small shapes in a free corner simplifies and speeds the placement algorithm as only the available angles are checked for possible placements, and collision detection only requires the checking of corners and edges of the placed shape. Since the proposed generator output has at least one exact solution, a series of optimization performed on the algorithm is also presented.

Sign in / Sign up

Export Citation Format

Share Document