The Three-Dimensional Bin Packing Problem

DOI10.1287/OPRE.48.2.256.12386zbMATH Open1106.90371OpenAlexW2101057470WikidataQ58826493 ScholiaQ58826493MaRDI QIDQ4530648FDOQ4530648

Authors: 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

Recommendations

• New lower bounds for the three-dimensional finite bin packing problem
• scientific article; zbMATH DE number 21364
• Guided local search for the three-dimensional bin-packing problem
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• On Three-Dimensional Packing

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• A global search framework for practical three-dimensional packing with variable carton orientations
• The exact solutions of several types of container loading problems
• A global optimization point of view to handle non-standard object packing problems
• Logistic constraints in container loading problems: the impact of complete shipment conditions
• An introduction to the two‐dimensional rectangular cutting and packing problem
• An open space based heuristic for the 2D strip packing problem with unloading constraints
• Product packing and stacking under uncertainty: a robust approach
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• A particular approach for the three-dimensional packing problem with additional constraints
• Modeling soft unloading constraints in the multi-drop container loading problem
• Fuzzy bin packing problem.
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
• Stabilized branch-and-price algorithms for vector packing problems
• Minimal surface convex hulls of spheres
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• A linear programming approach for the three-dimensional bin-packing problem
• The forgotten sons: warehousing systems for brick-and-mortar retail chains
• New lower bounds for the three-dimensional orthogonal bin packing problem
• Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• Irreducible bin packing and normality in routing open shop
• Three-stage heuristic algorithm for three-dimensional irregular packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Efficient algorithms for orthogonal packing problems
• A new search procedure for the two-dimensional orthogonal packing problem
• BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
• Vehicle routing with private and shared delivery locations
• Predicting packaging sizes using machine learning
• A data-driven approach for mixed-case palletization with support
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
• Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• A comparative review of 3D container loading algorithms
• A MIP-based slicing heuristic for three-dimensional bin packing
• Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
• Incremental bin packing
• Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
• Title not available (Why is that?)
• Sequential heuristic for the two-dimensional bin-packing problem
• On the hardness of palletizing bins using FIFO queues
• The multiple container loading problem with loading docks
• Packing problems in space solved by CPLEX: an experimental analysis
• Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships
• A two-phase constructive algorithm for the single container mix-loading problem
• Airfreight forwarder's shipment planning: shipment consolidation and containerization
• Trolley optimisation for loading printed circuit board components
• Data structures for higher-dimensional rectilinear packing
• A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
• A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
• Exploiting packing components in general-purpose integer programming solvers
• A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
• Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing
• A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
• The two dimensional bin packing problem with side constraints
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• 3-D container packing heuristics
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• Routing problems with loading constraints
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• On Three-Dimensional Packing
• New lower bound and exact method for the continuous berth allocation problem
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• A heuristic for solving large bin packing problems in two and three dimensions
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Heuristic algorithms for the three-dimensional bin packing problem
• The multiple container loading cost minimization problem
• A hybrid placement strategy for the three-dimensional strip packing problem
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
• Space and time allocation in a shipyard assembly hall
• Packing small boxes into a big box.
• The multiple container loading problem with preference
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
• The off-line group seat reservation problem
• A beam search approach to the container loading problem
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• A least wasted first heuristic algorithm for the rectangular packing problem
• A branch and bound algorithm for the strip packing problem
• Two- and three-dimensional parametric packing
• Fast machine reassignment
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• MIP-based heuristic for non-standard 3D-packing problems
• Two-dimensional packing problems: a survey
• A lower bound for the non-oriented two-dimensional bin packing problem
• An iterated local search algorithm for a place scheduling problem
• Container packing problem with balance constraints

This page was built for publication: The Three-Dimensional Bin Packing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530648)