A maximal-space algorithm for the container loading problem
From MaRDI portal
Recommendations
- Solving container loading problems by block arrangement
- Solving the single-container loading problem by a fast heuristic method
- Neighborhood structures for the container loading problem: a VNS implementation
- An Efficient Algorithm for Solving the Container Loading Problem
- A multi-start random constructive heuristic for the container loading problem
Cited in
(49)- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
- A beam search algorithm for the biobjective container loading problem
- A variable neighborhood search algorithm for the leather nesting problem
- A fast heuristic for a three-dimensional non-convex domain loading problem
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Container loading with multi-drop constraints
- 3D dynamic heterogeneous robotic palletization problem
- Static stability versus packing efficiency in online three-dimensional packing problems: a new approach and a computational study
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- The multiple container loading problem with loading docks
- Modeling soft unloading constraints in the multi-drop container loading problem
- Solving a large multicontainer loading problem in the car manufacturing industry
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- 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
- On the three-dimensional container packing problem under home delivery service
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A two-stage packing problem procedure
- A two-phase constructive algorithm for the single container mix-loading problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Weight distribution in container loading: a case study
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A tetris beam search algorithm for the distributor's pallet loading problem
- A heuristic algorithm for container loading of pallets with infill boxes
- A beam search approach to the container loading problem
- Applying spatial representation techniques to the container packing problem
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- An efficient placement heuristic for three-dimensional rectangular packing
- A tree search method for the container loading problem with shipment priority
- Container packing problem with balance constraints
- A tree search-based heuristic for the three-dimensional single container loading problem
- Solving container loading problems by block arrangement
- A fast optimization approach for a complex real-life 3D multiple bin size bin packing problem
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Space defragmentation for packing problems
- A multi-start random constructive heuristic for the container loading problem
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- A comparative review of 3D container loading algorithms
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Approximate dynamic programming for container stacking
This page was built for publication: A maximal-space algorithm for the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901024)
