Applying genetic algorithms and neural networks to the container loading problem

DOI10.1080/02522667.2003.10699576MaRDI QIDQ4469156zbMATH OpenOpenAlexFDO

Authors Jong-Mau Yeh, Yichen Lin, Shyue Hae Yu

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cites work

• A comparative evaluation of heuristics for container loading
• A computer-based heuristic for packing pooled shipment containers
• An algorithm for the 2D guillotine cutting stock problem
• An analytical model for the container loading problem
• 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
• Applying spatial representation techniques to the container packing problem
• Establishing the optimality of sequencing heuristics for cutting stock problems
• Guillotineable bin packing: A genetic approach
• How to use structural constraints to compute an upper bound for the pallet loading problem
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• On genetic algorithms for the packing of polygons
• Oriented aligned rectangle packing problem
• Packing different-sized circles into a rectangular container
• Packing problems
• Stock cutting to minimize cutting length

Cited in

(2)

• Constraints in container loading -- a state-of-the-art review
• A comparative review of 3D container loading algorithms

This page was built for publication: Applying genetic algorithms and neural networks to the container loading problem

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