Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
From MaRDI portal
Publication:2027076
DOI10.1016/j.cor.2020.105186OpenAlexW3112629014MaRDI QIDQ2027076
Leonardo Junqueira, Thiago Alves de Queiroz, Oliviana Xavier do Nascimento
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105186
Related Items
A large neighbourhood search algorithm for solving container loading problems ⋮ Modeling soft unloading constraints in the multi-drop container loading problem
Cites Work
- Unnamed Item
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- The three-dimensional knapsack problem with balancing constraints
- A novel hybrid tabu search approach to container loading
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- An analytical model for the container loading problem
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Solving a large multicontainer loading problem in the car manufacturing industry
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- 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
- LP bounds in various constraint programming approaches for orthogonal packing
- MIP-based approaches for the container loading problem with multi-drop constraints
- 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
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Constraints in container loading -- a state-of-the-art review
- A new constraint programming approach for the orthogonal packing problem
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- A Tree Search Algorithm for Solving the Container Loading Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- A parallel hybrid local search algorithm for the container loading problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Genetic Algorithm for Solving the Container Loading Problem
- The Three-Dimensional Bin Packing Problem
- The G4-Heuristic for the Pallet Loading Problem
- An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
