A fully three-dimensional heuristic algorithm for container packing

Show simple item record

dc.contributor.author Aspoas, Sean Graham
dc.date.accessioned 2016-11-01T10:26:01Z
dc.date.available 2016-11-01T10:26:01Z
dc.date.issued 2016
dc.identifier.uri http://hdl.handle.net/10539/21336
dc.description A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand, Johannesburg, 1996. Degree awarded with distinction on 4 December 1996.
dc.description.abstract We present a new three-dimensional container-packing algorithm. The algorithm is truly three-dimensional, thus, overcoming the limitations of layering algorithms, especially when a large number of parcel types is used. The algorithm sequentially places parcels into the container using localised heuristic information, and makes use of a balanced tree to store potential packing positions. The result is an algorithm with time complexity O(knlogn) where k is the number of parcel types, and n the maximum number of parcels that can be placed. Test results, including a comparative test, are very favourable, and show that the algorithms performance actually increases as the number of parcel types is increased.This is a direct result of the three-dimenslonal algorithm facilitating the utilisation of all useful packing positions using the variety of parcel sizes available.
dc.language.iso en en_ZA
dc.subject.lcsh Packaging
dc.subject.lcsh Containers
dc.subject.lcsh Algorithms
dc.title A fully three-dimensional heuristic algorithm for container packing en_ZA
dc.type Thesis en_ZA
dc.description.librarian GR 2016 en_ZA

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search WIReDSpace


My Account