Constraints in container loading -- a state-of-the-art review

DOI10.1016/J.EJOR.2012.12.006zbMATH Open1317.90172OpenAlexW2048325170MaRDI QIDQ2355797FDOQ2355797

Authors: Andreas Bortfeldt, Gerhard Wäscher 

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.12.006

Recommendations

• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• A comparative review of 3D container loading algorithms
• Optimization models for the three-dimensional container loading problem with practical constraints
• Logistic constraints in container loading problems: the impact of complete shipment conditions
• Vehicle routing problems with loading constraints: state-of-the-art and future directions

zbMATH Keywords

heuristicsconstraintsexact algorithmspackingcuttingcontainer loading

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06)

Cites Work

• A systematic approach for the three-dimensional palletization problem
• 3D random stacking of weakly heterogeneous palletization problems
• A linear programming approach for the three-dimensional bin-packing problem
• An Efficient Algorithm for Solving the Container Loading Problem
• On-line packing with boxes of different sizes
• Interactive ILP procedures for stacking optimization for the 3D palletization problem
• Applying genetic algorithms and neural networks to the container loading problem
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• Extreme point-based heuristics for three-dimensional bin packing
• Routing problems with loading constraints
• An integrated approach to the vehicle routing and container loading problems
• Heuristic algorithms for the three-dimensional bin packing problem
• Harmonic algorithm for \(3\)-dimensional strip packing problem
• Packing congruent hyperspheres into a hypersphere
• Weight distribution considerations in container loading
• An efficient approach for the multi-pallet loading problem
• Solving container loading problems by block arrangement
• A bottleneck assignment approach to the multiple container loading problem
• Neighborhood structures for the container loading problem: a VNS implementation
• A 3D-BPP approach for optimising stowage plans and terminal productivity
• Guided local search for the three-dimensional bin-packing problem
• A tree search algorithm for solving the container loading problem
• A maximal-space algorithm for the container loading problem
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• Practical Considerations of the Pallet-Loading Problem
• The Three-Dimensional Bin Packing Problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• The multiple container loading cost minimization problem
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Heuristics for the container loading problem
• A caving degree approach for the single container loading problem
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• Dynamic multi-dimensional bin packing
• A hybrid placement strategy for the three-dimensional strip packing problem
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• Translational packing of arbitrary polytopes
• Heuristics for container loading of furniture
• An analytical model for the container loading problem
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• Minimizing the object dimensions in circle and sphere packing problems
• Three-dimensional packing of items with limited load bearing strength
• On Three-Dimensional Packing
• An efficient placement heuristic for three-dimensional rectangular packing
• Two- and three-dimensional parametric packing
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• Loading plates with non-identical items
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A comparative evaluation of heuristics for container loading
• A heuristic for the three-dimensional strip packing problem
• An asymptotic approximation algorithm for 3D-strip packing
• A Genetic Algorithm for Solving the Container Loading Problem
• A Method for Solving Container Packing for a Single Size of Box
• Approximate algorithms for the container loading problem
• An AND/OR-graph approach to the container loading problem
• A hybrid genetic algorithm for the container loading problem
• A tree search method for the container loading problem with shipment priority
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• Integrated container loading software for pulp and paper industry
• Packing of various radii solid spheres into a parallelepiped.
• New lower bounds for the three-dimensional finite bin packing problem
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• A general purpose algorithm for three-dimensional packing
• Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
• Annealing, Cylinder Packing By Simulated
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Multi-dimensional bin packing problems with guillotine constraints
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
• A new heuristic algorithm for cuboids packing with no orientation constraints
• Three-dimensional packings with rotations
• Packing small boxes into a big box.
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• Loading Multiple Pallets
• 3-D container packing heuristics
• A novel hybrid tabu search approach to container loading
• Conservative scales in packing problems
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
• Packing of unequal spheres and automated radiosurgical treatment planning
• Cube packing.
• A global optimization algorithm for the three-dimensional packing problem
• A computer-based heuristic for packing pooled shipment containers
• Container loading with multi-drop constraints
• Heuristic algorithms for on-line packing in three dimensions
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• Stability aspects of pallet loading
• A multi-start random constructive heuristic for the container loading problem
• A distributed global optimization method for packing problems
• Applying spatial representation techniques to the container packing problem
• Layer-layout-based heuristics for loading homogeneous items into a single container
• A particular approach for the three-dimensional packing problem with additional constraints
• A heuristic approach to the three-dimensional cargo-loading problem
• A three-dimensional pallet loading method for single-size boxes
• Allowing for weight considerations in container loading
• Solving the single-container loading problem by a fast heuristic method
• Load planning for shipments of low density products
• Title not available (Why is that?)
• Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
• On the effectivity of gradient methods for cutting stock problems
• Heuristics with a new block strategy for the single and multiple containers loading problems
• Title not available (Why is that?)

Cited In (82)

• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• Configuration space of geometric objects
• A beam search algorithm for the biobjective container loading problem
• Exact solution techniques for two-dimensional cutting and packing
• Near optimal minimal convex hulls of disks
• The exact solutions of several types of container loading problems
• Logistic constraints in container loading problems: the impact of complete shipment conditions
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
• Minimizing late deliveries in a truck loading problem
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• The value of integrating loading and routing
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• Product packing and stacking under uncertainty: a robust approach
• Modeling soft unloading constraints in the multi-drop container loading problem
• Multi-objective vehicle routing and loading with time window constraints: a real-life application
• Solving a large multicontainer loading problem in the car manufacturing industry
• A large neighbourhood search algorithm for solving container loading problems
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• A new load balance methodology for container loading problem in road transportation
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• Inbound and outbound flow integration for cross-docking operations
• A two-stage packing problem procedure
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Robust storage assignment in stack- and queue-based storage systems
• Analysing trade-offs in container loading: combining load plan construction heuristics with agent-based simulation
• Weight distribution in container loading: a case study
• Optimized packing clusters of objects in a rectangular container
• The forgotten sons: warehousing systems for brick-and-mortar retail chains
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• The airline container loading problem with pickup and delivery
• A two-phase approach for single container loading with weakly heterogeneous boxes
• Three-stage heuristic algorithm for three-dimensional irregular packing problem
• A model‐based heuristic to the vehicle routing and loading problem
• The multiple container loading problem with preference
• A heuristic algorithm for container loading of pallets with infill boxes
• Robust storage loading problems with stacking and payload constraints
• A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
• The pallet loading problem: three-dimensional bin packing with practical constraints
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Formalizing spatial configuration optimization problems with the use of a special function class
• Approximate packing: integer programming models, valid inequalities and nesting
• A data-driven approach for mixed-case palletization with support
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
• A comparative review of 3D container loading algorithms
• A MIP-based slicing heuristic for three-dimensional bin packing
• Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
• Necessity and complexity of order picking routing optimisation based on pallet loading features
• The air cargo load planning problem -- a consolidated problem definition and literature review on related problems
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
• The Meet-in-the-Middle Principle for Cutting and Packing Problems
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• The split delivery vehicle routing problem with three-dimensional loading constraints
• An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
• The method of artificial space dilation in problems of optimal packing of geometric objects
• Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
• 3D dynamic heterogeneous robotic palletization problem
• Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
• The multiple container loading problem with loading docks
• 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
• Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships
• Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching
• A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority
• The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
• Loading optimization of an ordered set of aircrafts
• Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
• A mathematical modeling approach to optimize composite parts placement in autoclave
• A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
• A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
• Extracting maximal objects from three-dimensional solid materials
• Network scheduling problem with cross-docking and loading constraints
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• The pallet-loading vehicle routing problem with stability constraints
• The static stability of support factor‐based rectangular packings: an assessment by regression analysis
• A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
• Cargo securing under multi-drop and axle weight constraints
• An efficient method for the three-dimensional container loading problem by forming box sizes

Uses Software

• Algorithm 864
• TSpack

This page was built for publication: Constraints in container loading -- a state-of-the-art review

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