Logistic constraints in container loading problems: the impact of complete shipment conditions
From MaRDI portal
Publication:828763
DOI10.1007/s11750-020-00577-8zbMath1467.90023OpenAlexW3045000557MaRDI QIDQ828763
M. T. Alonso, I. Gimenez-Palacios, Ramón Alvarez-Valdés, Francisco Parreño
Publication date: 5 May 2021
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-020-00577-8
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Related Items
Cites Work
- A beam search approach to the container loading problem
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
- A novel hybrid tabu search approach to container loading
- A tree search method for the container loading problem with shipment priority
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Heuristics for container loading of furniture
- Weight distribution considerations in container loading
- 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 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 hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A bottleneck assignment approach to the multiple container loading problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Lifting for mixed integer programs with variable upper bounds
- Constraints in container loading -- a state-of-the-art review
- An improved typology of cutting and packing problems
- 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
- 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
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Container loading with multi-drop constraints
- A multi-start random constructive heuristic for the container loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- 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
- A hybrid genetic algorithm for the container loading problem
