A tree search method for the container loading problem with shipment priority
From MaRDI portal
Publication:635159
DOI10.1016/j.ejor.2011.04.025zbMath1219.90024OpenAlexW2023995268MaRDI QIDQ635159
Tetsuo Sawaragi, Yajie Tian, Jidong Ren
Publication date: 19 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.025
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ The multiple container loading problem with preference ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ A beam search algorithm for the biobjective container loading problem ⋮ Minimizing late deliveries in a truck loading problem ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ A comparative review of 3D container loading algorithms ⋮ An AIMMS-based decision-making model for optimizing the intelligent stowage of export containers in a single bay ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- Weight distribution considerations in container loading
- A tabu search algorithm for weakly heterogeneous container loading problems
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- Three-dimensional packing of items with limited load bearing strength
- 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
- Container loading with multi-drop constraints
- A Genetic Algorithm for Solving the Container Loading Problem
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- Loading Multiple Pallets
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A tree search method for the container loading problem with shipment priority
