A heuristic algorithm for carton to pallet loading problem
Le, Vu, Creighton, Doug and Nahavandi, Saeid 2005, A heuristic algorithm for carton to pallet loading problem, in INDIN 2005 : Proceedings of the 3rd IEEE International Conference on Industrial Informatics 2005, IEEE, Piscataway, N. J., pp. 593-598.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
INDIN 2005 : Proceedings of the 3rd IEEE International Conference on Industrial Informatics 2005
IEEE International Conference on Industrial Informatics
viii, 844 p.
Place of publication
Piscataway, N. J.
This paper presents an algorithm used to solve a carton to pallet packing problem in a drink manufacturing firm. The aim was to determine the cartons loading sequence and the number pallets required, prior to dispatch by truck. The algorithm consists of a series of nine parts to solve this industrial application problem. The pallet loading solution relatively computationally efficient and reduces the number pallets required, compared to other 'trail and error' or manual spreadsheet calculation methods.
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.