A two-phase approach for single container loading with weakly heterogeneous boxes
From MaRDI portal
Publication:2312435
DOI10.3390/A12040067zbMATH Open1461.90118OpenAlexW2933739268MaRDI QIDQ2312435FDOQ2312435
Authors: Rommel Dias Saraiva, Napoleão Nepomuceno, Placido Rogerio Pinheiro 
Publication date: 8 July 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a12040067
Recommendations
- Heuristics with a new block strategy for the single and multiple containers loading problems
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A parallel hybrid local search algorithm for the container loading problem
- An efficient method for the three-dimensional container loading problem by forming box sizes
- Solving container loading problems by block arrangement
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cites Work
- An improved typology of cutting and packing problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- 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
- Constraints in container loading -- a state-of-the-art review
- A tree search algorithm for solving the container loading problem
- A parallel hybrid local search algorithm for the container loading problem
- Heuristics for the container loading problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Decomposition based hybrid metaheuristics
- An efficient placement heuristic for three-dimensional rectangular packing
- The multiple container loading problem with preference
- A beam search approach to the container loading problem
- A Genetic Algorithm for Solving the Container Loading Problem
- An AND/OR-graph approach to the container loading problem
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- A Hybrid Optimization Framework for Cutting and Packing Problems
- A novel hybrid tabu search approach to container loading
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Load planning for shipments of low density products
Cited In (4)
- A two-phase constructive algorithm for the single container mix-loading problem
- A comparative analysis of two matheuristics by means of merged local optima networks
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- An efficient method for the three-dimensional container loading problem by forming box sizes
Uses Software
This page was built for publication: A two-phase approach for single container loading with weakly heterogeneous boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312435)
