Applying genetic algorithms and neural networks to the container loading problem
From MaRDI portal
Publication:4469156
DOI10.1080/02522667.2003.10699576zbMath1180.90391OpenAlexW2039384520MaRDI QIDQ4469156
Yichen Lin, Shyue Hae Yu, Jong-Mau Yeh
Publication date: 14 June 2004
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2003.10699576
Related Items (2)
A comparative review of 3D container loading algorithms ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Establishing the optimality of sequencing heuristics for cutting stock problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Guillotineable bin packing: A genetic approach
- How to use structural constraints to compute an upper bound for the pallet loading problem
- Packing different-sized circles into a rectangular container
- An analytical model for the container loading problem
- Oriented aligned rectangle packing problem
- Packing problems
- Stock cutting to minimize cutting length
- On genetic algorithms for the packing of polygons
- An algorithm for the 2D guillotine cutting stock problem
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- Applying spatial representation techniques to the container packing problem
This page was built for publication: Applying genetic algorithms and neural networks to the container loading problem