A new constraint programming approach for the orthogonal packing problem

Authors:
François Clautiaux;Antoine Jouglet;Jacques Carlier;Aziz Moukrim
Affiliations:
Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France;Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France;Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France;Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 17

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Constraint-Based Scheduling

Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Mathematics of Operations Research
Sweep synchronization as a global propagation mechanism

Computers and Operations Research
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research
Bidimensional packing by bilinear programming

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
On the two-dimensional Knapsack Problem

Operations Research Letters

A global constraint for total weighted completion time for cumulative resources

Engineering Applications of Artificial Intelligence
A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
New filtering for the cumulative constraint in the context of non-overlapping rectangles

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 squeaky wheel optimisation methodology for two-dimensional strip packing

Computers and Operations Research
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Computers and Operations Research
Rectangle packing with additional restrictions

Theoretical Computer Science
LP bounds in various constraint programming approaches for orthogonal packing

Computers and Operations Research
Automating the packing heuristic design process with genetic programming

Evolutionary Computation
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 Reinforced Tabu Search Approach for 2D Strip Packing

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a new constraint-based scheduling model. We provide a generalization of energetic reasoning techniques for the problem under investigation. Feasibility tests requiring the solution of subset-sum problems are described. Computational results confirm the efficiency of our method compared to others in the literature.