DEVELOPMENT OF THE ALGORITHM FOR SOLVING THE PALLET PACKING PROBLEM
DOI:
https://doi.org/10.24867/12IH01TrisicKeywords:
Pallet packing problem, Algorithm, Transport Packaging, Transport Pallet, TransportAbstract
The topic of this paper is the introduction of a new algorithm for the distributor pallet packing problem. This problem is NP-complete. The algorithm tries to imitate a human behaviour. In the algorithm development, it was assumed that all boxes that need to be packed have at least one common edge size to reduce the 3D problem to 2D one. A tool for visualisation of the output from the algorithm has been developed in order to facilitate its development and testing.
References
[1] G. Abdou, M. Elmasry, “3D random stacking of weakly heterogeneous palletization problems,” International Journal of Production Research, vol. 37, No. 7, pp. 1505-1524. 1999.
[2] Internet stranica: https://github.com/zelimir996/pallet_packing_problem, pristupljeno dana 10.10.2020.
[2] Internet stranica: https://github.com/zelimir996/pallet_packing_problem, pristupljeno dana 10.10.2020.
Downloads
Published
2021-05-09
Issue
Section
Mechatronics
