A large neighbourhood search algorithm for solving container loading problems
From MaRDI portal
Publication:6109572
DOI10.1016/j.cor.2023.106199MaRDI QIDQ6109572
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Routing problems with loading constraints
- A novel hybrid tabu search approach to container loading
- The multiple container loading cost minimization problem
- A tree search method for the container loading problem with shipment priority
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- 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
- Weight distribution considerations in container loading
- An analytical model for the container loading problem
- A heuristic for multiple container loading problems
- An efficient approach for the multi-pallet 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
- 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 comparative evaluation of heuristics for container loading
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- A bottleneck assignment approach to the multiple container loading problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A prototype column generation strategy for the multiple container loading problem
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Neighborhood structures for the container loading problem: a VNS implementation
- The exact solutions of several types of container loading problems
- Constraints in container loading -- a state-of-the-art review
- 3-D container packing heuristics
- An improved typology of cutting and packing problems
- A 3D-BPP approach for optimising stowage plans and terminal productivity
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A comparative review of 3D container loading algorithms
- A parallel hybrid local search algorithm for the container loading problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A Genetic Algorithm for Solving the Container Loading Problem
- Applying spatial representation techniques to the container packing problem
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A large neighbourhood search algorithm for solving container loading problems