A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
New lower bounds for the three-dimensional finite bin packing problem
Discrete Applied Mathematics
3-D Container Packing Heuristics
Applied Intelligence
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
ACM Transactions on Mathematical Software (TOMS)
Two- and three-dimensional parametric packing
Computers and Operations Research
A strategic knowledge-based planning system for freight forwarding industry
Expert Systems with Applications: An International Journal
A General Purpose Algorithm for Three-Dimensional Packing
INFORMS Journal on Computing
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Development of an optimised transport logistics system for supporting distribution operations
International Journal of Computer Applications in Technology
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem
Computers and Operations Research
Arc-flow model for the two-dimensional guillotine cutting stock problem
Computers and Operations Research
IEEE Transactions on Intelligent Transportation Systems
A particular approach for the Three-dimensional Packing Problem with additional constraints
Computers and Operations Research
Multi-dimensional bin packing problems with guillotine constraints
Computers and Operations Research
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
Computers and Operations Research
Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
Efficient lower bounds and heuristics for the variable cost and size bin packing problem
Computers and Operations Research
Three-dimensional container loading models with cargo stability and load bearing constraints
Computers and Operations Research
A parallel multi-population biased random-key genetic algorithm for a container loading problem
Computers and Operations Research
Expert Systems with Applications: An International Journal
A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
A priority-considering approach for the multiple container loading problem
International Journal of Metaheuristics
Decision support for packing in warehouses
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
Computers and Operations Research
Computers and Operations Research
A global search framework for practical three-dimensional packing with variable carton orientations
Computers and Operations Research
Bidimensional packing by bilinear programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Space defragmentation heuristic for 2D and 3D bin packing problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Multi-container loading with non-convex 3D shapes using a GA/TS hybrid
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Data Structures for Higher-Dimensional Rectilinear Packing
INFORMS Journal on Computing
The Pallet-Packing Vehicle Routing Problem
Transportation Science
Mixed pallet stacking: an overview and summary of the 2010 PerMIS special session
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
Packing first, routing second-a heuristic for the vehicle routing and loading problem
Computers and Operations Research
Comparing several heuristics for a packing problem
International Journal of Advanced Intelligence Paradigms
Journal of Mathematical Modelling and Algorithms
INFORMS Journal on Computing
Online scheduling for multi-core shared reconfigurable fabric
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Computers and Operations Research
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
A beam search approach to the container loading problem
Computers and Operations Research
| Hi-index | 0.00 |
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is ?. An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms. Extensive computational results, involving instances with up to 90 items, are presented: It is shown that many instances can be solved to optimality within a reasonable time limit.