A Maximal-Space Algorithm for the Container Loading Problem
From MaRDI portal
Publication:2901024
DOI10.1287/ijoc.1070.0254zbMath1243.90094OpenAlexW2134288639MaRDI QIDQ2901024
José Manuel Tamarit, Ramón Alvarez-Valdés, José Fernando Oliveira, Francisco Parreño
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/dda18e1719d5373cca30ba13adba912c50e5410e
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Combinatorial aspects of packing and covering (05B40)
Related Items (38)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ 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 beam search approach to the container loading problem ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ Solving a large multicontainer loading problem in the car manufacturing industry ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ A reference length approach for the 3D strip packing problem ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ Space defragmentation for packing problems ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ A beam search algorithm for the biobjective container loading problem ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ The multiple container loading problem with loading docks ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A tree search method for the container loading problem with shipment priority ⋮ A two-stage packing problem procedure ⋮ A variable neighborhood search algorithm for the leather nesting problem ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ Container packing problem with balance constraints ⋮ 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 ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Neighborhood structures for the container loading problem: a VNS implementation ⋮ An efficient placement heuristic for three-dimensional rectangular packing ⋮ A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ Container loading with multi-drop constraints ⋮ ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: A Maximal-Space Algorithm for the Container Loading Problem
