ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE
From MaRDI portal
Publication:3103655
DOI10.1142/S0217595911003466zbMath1228.90012WikidataQ60537615 ScholiaQ60537615MaRDI QIDQ3103655
Chang-Sung Yu, Chun-Cheng Lin, Wan-Yu Liu
Publication date: 8 December 2011
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Related Items
A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, A comparative review of 3D container loading algorithms, A global optimization approach for solving three-dimensional open dimension rectangular packing problems
Uses Software
Cites Work
- Unnamed Item
- An improved typology of cutting and packing problems
- A Maximal-Space Algorithm for the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Genetic Algorithm for Solving the Container Loading Problem
- A systematic approach for the three-dimensional palletization problem
- 3D random stacking of weakly heterogeneous palletization problems
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- An AND/OR-graph approach to the container loading problem
- Multistage Cutting Stock Problems of Two and More Dimensions