Heuristics for the container loading problem
From MaRDI portal
Publication:1847185
DOI10.1016/S0377-2217(02)00132-7zbMath1081.90613DBLPjournals/eor/Pisinger02WikidataQ58826467 ScholiaQ58826467MaRDI QIDQ1847185
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (70)
A parallel hybrid local search algorithm for the container loading problem ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ A heuristic for solving large bin packing problems in two and three dimensions ⋮ A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ A caving degree approach for the single container loading problem ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ The disruptive anti-covering location problem ⋮ The multiple container loading problem with preference ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ An effective hybrid algorithm for the problem of packing circles into a larger containing circle ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ An improved typology of cutting and packing problems ⋮ A heuristic for the three-dimensional strip packing problem ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ The air-cargo consolidation problem with pivot weight: models and solution methods ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block 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 ⋮ A reference length approach for the 3D strip packing problem ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ A novel hybrid tabu search approach to container loading ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ A model‐based heuristic to the vehicle routing and loading problem ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A tree search method for the container loading problem with shipment priority ⋮ Metaheuristics for truck loading in the car production industry ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Layer-layout-based heuristics for loading homogeneous items into a single container ⋮ A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Container packing problem with balance constraints ⋮ CAST: A Successful Project in Support of the International Space Station Logistics ⋮ A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis ⋮ Graph Coloring Models and Metaheuristics for Packing Applications ⋮ Two-dimensional knapsack-block packing problem ⋮ A new heuristic algorithm for cuboids packing with no orientation constraints ⋮ AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ 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 ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ A new heuristic recursive algorithm for the strip rectangular packing problem ⋮ New lower bounds for bin packing problems with conflicts ⋮ Neighborhood structures for the container loading problem: a VNS implementation ⋮ Packing of convex polytopes into a parallelepiped ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ Container loading with multi-drop constraints ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ Three-dimensional bin packing problem with variable bin height ⋮ Heuristics for container loading of furniture ⋮ Three-dimensional packing of items with limited load bearing strength ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Constraints in container loading -- a state-of-the-art review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Weight distribution considerations in container loading
- Loading plates with non-identical items
- An analytical model for the container loading problem
- A typology of cutting and packing problems
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A parallel hybrid local search algorithm for the container loading problem
- A Genetic Algorithm for Solving the Container Loading Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- The Three-Dimensional Bin Packing Problem
- An AND/OR-graph approach to the container loading problem
- Loading Multiple Pallets
- Multistage Cutting Stock Problems of Two and More Dimensions
This page was built for publication: Heuristics for the container loading problem
