The Three-Dimensional Bin Packing Problem

DOI10.1287/opre.48.2.256.12386zbMath1106.90371OpenAlexW2101057470WikidataQ58826493 ScholiaQ58826493MaRDI QIDQ4530648

Silvano Martello, David Pisinger, Daniele Vigo

Publication date: 4 June 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5befca07fc703127cc765576bda1edcfb7cef803

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, An introduction to the two‐dimensional rectangular cutting and packing problem, Airfreight forwarder's shipment planning: shipment consolidation and containerization, The multiple container loading problem with loading docks, Modeling soft unloading constraints in the multi-drop container loading problem, Efficient algorithms for orthogonal packing problems, New Lower Bound and Exact Method for the Continuous Berth Allocation Problem, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Logistic constraints in container loading problems: the impact of complete shipment conditions, A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, A heuristic for solving large bin packing problems in two and three dimensions, Sequential heuristic for the two-dimensional bin-packing problem, Minimal surface convex hulls of spheres, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, A lower bound for the non-oriented two-dimensional bin packing problem, Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system, The multiple container loading problem with preference, The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A 3D-BPP approach for optimising stowage plans and terminal productivity, A beam search approach to the container loading problem, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, Fast machine reassignment, An exact strip packing algorithm based on canonical forms, Models and algorithms for packing rectangles into the smallest square, The load-balanced multi-dimensional bin-packing problem, Arc-flow model for the two-dimensional guillotine cutting stock problem, Predicting packaging sizes using machine learning, A data-driven approach for mixed-case palletization with support, Corner occupying theorem for the two-dimensional integral rectangle packing problem, On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Two- and three-dimensional parametric packing, Vehicle routing with private and shared delivery locations, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension, Space defragmentation for packing problems, A prototype column generation strategy for the multiple container loading problem, Space and time allocation in a shipyard assembly hall, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, Optimal rectangle packing, Routing problems with loading constraints, The off-line group seat reservation problem, Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques, A MIP-based slicing heuristic for three-dimensional bin packing, A new search procedure for the two-dimensional orthogonal packing problem, A global optimization point of view to handle non-standard object packing problems, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, The multiple container loading cost minimization problem, The three-dimensional knapsack problem with balancing constraints, An iterated local search algorithm for a place scheduling problem, Container packing problem with balance constraints, Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Product packing and stacking under uncertainty: a robust approach, A new exact method for the two-dimensional bin-packing problem with fixed orientation, Irreducible bin packing and normality in routing open shop, Ant colony optimization for the two-dimensional loading vehicle routing problem, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints, A least wasted first heuristic algorithm for the rectangular packing problem, Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, A global search framework for practical three-dimensional packing with variable carton orientations, Three-dimensional container loading models with cargo stability and load bearing constraints, A parallel multi-population biased random-key genetic algorithm for a container loading problem, Lower bounds for three-dimensional multiple-bin-size bin packing problems, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, A particular approach for the three-dimensional packing problem with additional constraints, Multi-dimensional bin packing problems with guillotine constraints, Unnamed Item, A greedy search for the three-dimensional bin packing problem: the packing static stability case, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Grids for cutting and packing problems: a study in the 2D knapsack problem, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, The Two Dimensional Bin Packing Problem with Side Constraints, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Stabilized branch-and-price algorithms for vector packing problems, Three-stage heuristic algorithm for three-dimensional irregular packing problem, BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem, Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, A comparative review of 3D container loading algorithms, Data Structures for Higher-Dimensional Rectilinear Packing, The exact solutions of several types of container loading problems, Bidimensional packing by bilinear programming, A branch and bound algorithm for the strip packing problem, An open space based heuristic for the 2D strip packing problem with unloading constraints, Exact algorithms for the two-dimensional strip packing problem with and without rotations, MIP-based heuristic for non-standard 3D-packing problems, New lower bounds for the three-dimensional finite bin packing problem, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, Three-dimensional bin packing problem with variable bin height, A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning, On the hardness of palletizing bins using FIFO queues, The two-dimensional bin packing problem with variable bin sizes and costs, Heuristics for the container loading problem, Two-dimensional packing problems: a survey, Heuristic algorithms for the three-dimensional bin packing problem, 3-D container packing heuristics, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Constraints in container loading -- a state-of-the-art review