A two-phase constructive algorithm for the single container mix-loading problem
From MaRDI portal
Recommendations
- A beam search approach to the container loading problem
- Solving the single-container loading problem by a fast heuristic method
- A two-phase approach for single container loading with weakly heterogeneous boxes
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A heuristic algorithm for container loading of pallets with infill boxes
Cites work
- A beam search algorithm for the biobjective container loading problem
- A beam search approach to the container loading problem
- A caving degree approach for the single container loading problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A comparative evaluation of heuristics for container loading
- A comparative review of 3D container loading algorithms
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A Genetic Algorithm for Solving the Container Loading Problem
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A heuristic algorithm for container loading of pallets with infill boxes
- A hybrid genetic algorithm for the container loading problem
- A maximal-space algorithm for the container loading problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A new iterative-doubling greedy-lookahead algorithm for the single 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 recursive exact algorithm for weighted two-dimensional cutting
- A tabu search algorithm for weakly heterogeneous container loading problems
- A tree search algorithm for solving the container loading problem
- An AND/OR-graph approach to the container loading 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
- Applying spatial representation techniques to the container packing problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Heuristics for the container loading problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Loading plates with non-identical items
- Solving container loading problems by block arrangement
- The exact solutions of several types of container loading problems
- The Theory and Computation of Knapsack Functions
- The Three-Dimensional Bin Packing Problem
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Weight distribution considerations in container loading
This page was built for publication: A two-phase constructive algorithm for the single container mix-loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596958)
