The exact solutions of several types of container loading problems
From MaRDI portal
Publication:2301942
DOI10.1016/j.ejor.2019.12.012zbMath1441.90136OpenAlexW2995070549MaRDI QIDQ2301942
Cleder M. Schenekemberg, Cassius T. Scarpin, Leandro C. Coelho, Deidson Vitorio Kurpel, José Eduardo jun. Pécora
Publication date: 25 February 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.12.012
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ The multiple container loading problem with loading docks ⋮ Modeling and solving the waste valorization production and distribution scheduling problem
Cites Work
- Unnamed Item
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- The multiple container loading problem with preference
- A heuristic algorithm for container loading of pallets with infill boxes
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A beam search approach to the container loading problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- The multiple container loading cost minimization problem
- A particular approach for the three-dimensional packing problem with additional constraints
- An analytical model for the container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A heuristic for multiple container loading problems
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Solving a large multicontainer loading problem in the car manufacturing industry
- A MIP-based slicing heuristic for three-dimensional bin packing
- 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 tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Solving container loading problems by block arrangement
- A bottleneck assignment approach to the multiple container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Constraints in container loading -- a state-of-the-art review
- An improved typology of cutting and packing problems
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- A comparative review of 3D container loading algorithms
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- Approximate algorithms for the container loading problem
- The Three-Dimensional Bin Packing Problem
- The G4-Heuristic for the Pallet Loading Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: The exact solutions of several types of container loading problems
