A heuristic algorithm for carton to pallet loading problem

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.