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. / 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. / GR 2016
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:wits/oai:wiredspace.wits.ac.za:10539/21336 |
| Date | January 2016 |
| Creators | Aspoas, Sean Graham |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
Page generated in 0.0014 seconds