Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
From MaRDI portal
Publication:2901020
DOI10.1287/ijoc.1070.0250zbMath1243.90088OpenAlexW2161926431WikidataQ58644525 ScholiaQ58644525MaRDI QIDQ2901020
Guido Perboli, Roberto Tadei, Teodor Gabriel Crainic
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/23de452bc7156a145d3433d2c7e6972f3562cbbc
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Combinatorial aspects of packing and covering (05B40)
Related Items (51)
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 ⋮ TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints ⋮ The multiple container loading problem with preference ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A data-driven approach for mixed-case palletization with support ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ A reference length approach for the 3D strip packing problem ⋮ Space defragmentation for packing problems ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ Routing problems with loading constraints ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban ⋮ The multiple container loading problem with loading docks ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ The multiple container loading cost minimization problem ⋮ A two-stage packing problem procedure ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ An iterated local search algorithm for a place scheduling problem ⋮ Container packing problem with balance constraints ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING ⋮ 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 ⋮ The load planning problem for double-stack intermodal trains ⋮ Efficient algorithms for orthogonal packing problems ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ 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 ⋮ A particular approach for the three-dimensional packing problem with additional constraints ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ A comparative review of 3D container loading algorithms ⋮ The maximum diversity assortment selection problem ⋮ Data Structures for Higher-Dimensional Rectilinear Packing ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ Three-dimensional bin packing problem with variable bin height ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Constraints in container loading -- a state-of-the-art review ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Uses Software
This page was built for publication: Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
