A beam search approach to the container loading problem

DOI10.1016/J.COR.2013.09.003zbMATH Open1348.90532OpenAlexW2030502861MaRDI QIDQ336892FDOQ336892

Authors: M.-C. Riff, I. 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

Recommendations

• A beam search algorithm for the biobjective container loading problem
• An Efficient Algorithm for Solving the Container Loading Problem
• A tree search algorithm for solving the container loading problem
• Solving the single-container loading problem by a fast heuristic method
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem

zbMATH Keywords

combinatorial optimizationbeam searchconstructive algorithmscontainer loading problemload planing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• An improved typology of cutting and packing problems
• Title not available (Why is that?)
• Weight distribution considerations in container loading
• Solving container loading problems by block arrangement
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• Neighborhood structures for the container loading problem: a VNS implementation
• 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
• The Three-Dimensional Bin Packing Problem
• An efficient placement heuristic for three-dimensional rectangular packing
• Loading plates with non-identical items
• A Genetic Algorithm for Solving the Container Loading Problem
• An AND/OR-graph approach to the container loading problem
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container

Cited In (24)

• A beam search algorithm for the biobjective container loading problem
• The exact solutions of several types of container loading problems
• Logistic constraints in container loading problems: the impact of complete shipment conditions
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• The risk-averse traveling repairman problem with profits
• VCS: A new heuristic function for selecting boxes in the single container loading problem
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• A two-stage packing problem procedure
• A two-phase constructive algorithm for the single container mix-loading problem
• The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• 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
• Solving a large cutting problem in the glass manufacturing industry
• A two-phase approach for single container loading with weakly heterogeneous boxes
• A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
• 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 load sequencing of outbound containers in port container terminals
• A beam search algorithm for minimizing crane times in premarshalling problems
• The static stability of support factor‐based rectangular packings: an assessment by regression analysis
• A comparative review of 3D container loading algorithms
• An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
• An efficient method for the three-dimensional container loading problem by forming box sizes

This page was built for publication: A beam search approach to the container loading problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336892)