A tree search-based heuristic for the three-dimensional single container loading problem

DOI10.1016/J.EJOR.2026.01.039MaRDI QIDQ7255917zbMATH OpenFDO

Authors Lucas Guesser, Thiago Alves De Queiroz, Flávio Keidi Miyazawa

Publication date 1 June 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2026.01.039

zbMATH Keywords

beam search algorithmcontainer loading problemheuristicpackingtree search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A beam search approach to the container loading problem
• A comparative review of 3D container loading algorithms
• A Genetic Algorithm for Solving the Container Loading Problem
• A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
• A maximal-space algorithm for the container loading problem
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• A tree search algorithm for solving the container loading problem
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• An AND/OR-graph approach to the container loading problem
• An improved typology of cutting and packing problems
• Applying spatial representation techniques to the container packing problem
• Constraints in container loading -- a state-of-the-art review
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Extreme point-based heuristics for three-dimensional bin packing
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Modeling soft unloading constraints in the multi-drop container loading problem
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Solving container loading problems by block arrangement
• The exact solutions of several types of container loading problems
• VCS: A new heuristic function for selecting boxes in the single container loading problem
• Weight distribution considerations in container loading
• Weight distribution in container loading: a case study

This page was built for publication: A tree search-based heuristic for the three-dimensional single container loading problem

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