A tree search algorithm for solving the container loading problem
From MaRDI portal
Recommendations
- A multi-level tree search algorithm for three dimensional container loading problem
- A general purpose algorithm for three-dimensional packing
- A tree search method for the container loading problem with shipment priority
- An Efficient Algorithm for Solving the Container Loading Problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
Cited in
(52)- A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
- A global search framework for practical three-dimensional packing with variable carton orientations
- A beam search algorithm for the biobjective container loading problem
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Multi-variant optimization algorithm for three dimensional container loading problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Container loading with multi-drop constraints
- 3D dynamic heterogeneous robotic palletization problem
- The semi-online robotic pallet loading problem
- A general purpose algorithm for three-dimensional packing
- 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 hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- 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
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
- Approximate algorithms for the container loading problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- A tetris beam search algorithm for the distributor's pallet loading problem
- The multiple container loading problem with preference
- A heuristic algorithm for container loading of pallets with infill boxes
- A beam search approach to the container loading problem
- A cost-efficient method to optimize package size in emerging markets
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- A tree search method for the container loading problem with shipment priority
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A tree search procedure for the container relocation problem
- A tree search-based heuristic for the three-dimensional single container loading 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 cutting plane method and a parallel algorithm for packing rectangles in a circular container
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- A tabu search algorithm for weakly heterogeneous container loading problems
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A comparative review of 3D container loading algorithms
- Constraints in container loading -- a state-of-the-art review
- A multi-level tree search algorithm for three dimensional container loading problem
- A tree search heuristic for the resource constrained project scheduling problem with transfer times
- Dynamic reduction heuristics for the rectangle packing area minimization problem
- A parallel hybrid local search algorithm for the container loading problem
This page was built for publication: A tree search algorithm for solving the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899056)
