A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
From MaRDI portal
Publication:2664409
DOI10.1016/J.COR.2020.105058zbMATH Open1458.90542OpenAlexW2980358186MaRDI QIDQ2664409FDOQ2664409
Authors: Yanyan Li 
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/657961
Recommendations
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- A particular approach for the three-dimensional packing problem with additional constraints
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- Optimization models for the three-dimensional container loading problem with practical constraints
- The pallet loading problem: three-dimensional bin packing with practical constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An improved typology of cutting and packing problems
- Solving container loading problems by block arrangement
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Constraints in container loading -- a state-of-the-art review
- A tree search algorithm for solving the container loading problem
- Heuristics for container loading of furniture
- An analytical model for the container loading problem
- Three-dimensional packing of items with limited load bearing strength
- On the Solution of Discrete Programming Problems
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A beam search approach to the container loading problem
- Approximate algorithms for the container loading problem
- A tree search method for the container loading problem with shipment priority
- Container packing problem with balance constraints
- A novel hybrid tabu search approach to container loading
- Container loading with multi-drop constraints
- VCS: A new heuristic function for selecting boxes in the single 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-phase approach for single container loading with weakly heterogeneous boxes
Cited In (2)
This page was built for publication: A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664409)
