A beam search approach to the container loading problem
From MaRDI portal
Publication:336892
DOI10.1016/j.cor.2013.09.003zbMath1348.90532OpenAlexW2030502861MaRDI QIDQ336892
María-Cristina Riff, Ignacio J. Araya
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/129315
Related Items (20)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts ⋮ An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ 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 ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A two-stage packing problem procedure ⋮ 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 ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ The risk-averse traveling repairman problem with profits ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
Cites Work
- Unnamed Item
- An efficient placement heuristic for three-dimensional rectangular packing
- Weight distribution considerations in container loading
- Loading plates with non-identical items
- Solving container loading problems by block arrangement
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- An improved typology of cutting and packing problems
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Maximal-Space Algorithm for the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- A Genetic Algorithm for Solving the Container Loading Problem
- The Three-Dimensional Bin Packing Problem
- An AND/OR-graph approach to the container loading problem
This page was built for publication: A beam search approach to the container loading problem
