An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Authors:
Sándor P. Fekete;Jörg Schepers;Jan C. van der Veen
Affiliations:
Department of Mathematical Optimization, Braunschweig University of Technology, D--38106 Braunschweig, Germany;IBM Germany, Gustav-Heinemann-Ufer 120/122, D--50968 Köln, Germany;Department of Mathematical Optimization, Braunschweig University of Technology, D--38106 Braunschweig, Germany
Venue:
Operations Research
Year:
2007

Citing 0
Cited 28

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
A new heuristic algorithm for rectangle packing

Computers and Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
Heuristic approaches for the two- and three-dimensional knapsack packing problem

Computers and Operations Research
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
Fitness-distance correlation and solution-guided multi-point constructive search for CSPs

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A new graph-theoretical model for k-dimensional guillotine-cutting problems

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem

Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research
Maximizing revenue with allocation of multiple advertisements on a Web banner

Computers and Operations Research
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Computers and Operations Research
Exact algorithms for the two-dimensional guillotine knapsack

Computers and Operations Research
A fast layer-based heuristic for non-guillotine strip packing

Expert Systems with Applications: An International Journal
Optimal carpet cutting

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Computers and Operations Research
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

Computers and Operations Research
A global search framework for practical three-dimensional packing with variable carton orientations

Computers and Operations Research
A SAT encoding for multi-dimensional packing problems

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems

Journal of Mathematical Modelling and Algorithms
MPQ-trees for the Orthogonal Packing Problem

Journal of Mathematical Modelling and Algorithms
A new exact method for the two-dimensional bin-packing problem with fixed orientation

Operations Research Letters
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization
The six elements to block-building approaches for the single container loading problem

Applied Intelligence
A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

International Journal of Applied Metaheuristic Computing
Conservative scales in packing problems

OR Spectrum
A New Graph-Theoretical Model for the Guillotine-Cutting Problem

INFORMS Journal on Computing
On the weak computability of a four dimensional orthogonal packing and time scheduling problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature. This is the third in a series of articles describing new approaches to higher-dimensional packing.