A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
From MaRDI portal
Recommendations
- Solving the single-container loading problem by a fast heuristic method
- Heuristics with a new block strategy for the single and multiple containers loading problems
- An Efficient Algorithm for Solving the Container Loading Problem
- A tree search algorithm for solving the container loading problem
- VCS: A new heuristic function for selecting boxes in the single container loading problem
Cites work
- A Genetic Algorithm for Solving the Container Loading Problem
- A hybrid genetic algorithm for 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
- A tree search algorithm for solving the container loading problem
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Allowing for weight considerations in container loading
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An efficient approach for the multi-pallet loading problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An improved typology of cutting and packing problems
- Heuristic algorithms for the multiple knapsack problem
- Heuristics for the container loading problem
- Loading Multiple Pallets
- Neighborhood structures for the container loading problem: a VNS implementation
- Solving container loading problems by block arrangement
- The multiple container loading cost minimization problem
- Three-dimensional packing of items with limited load bearing strength
- Weight distribution considerations in container loading
Cited in
(30)- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- A prototype column generation strategy for the multiple container loading problem
- A beam search algorithm for the biobjective container loading problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- A caving degree approach for the single container loading problem
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- A comparative review of 3D container loading algorithms
- A tree search algorithm for solving the container loading problem
- A two-stage packing problem procedure
- 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
- 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
- Solving the single-container loading problem by a fast heuristic method
- Heuristics with a new block strategy for the single and multiple containers loading problems
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- A fast implementation for the 2D/3D box placement problem
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- 3D dynamic heterogeneous robotic palletization problem
- A two-phase constructive algorithm for the single container mix-loading problem
- A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items
- Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
- The semi-online robotic pallet loading problem
- A tree search-based heuristic for the three-dimensional single container loading problem
- A low-carbon resource-constrained project scheduling problem with limited three-dimensional workspaces and its hierarchical deep reinforcement learning approach
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
This page was built for publication: A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926951)