By Topic

A heuristic algorithm for carton to pallet loading problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
V. T. Lel ; Intelligent Syst. Res. Lab., Deakin Univ., Geelong, Vic., Australia ; D. Creighton ; S. Nahavandi

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.

Published in:

INDIN '05. 2005 3rd IEEE International Conference on Industrial Informatics, 2005.

Date of Conference:

10-12 Aug. 2005