|Title:||Airfreight cargo packing heuristics : a cost comparison|
|Subject:||Hong Kong Polytechnic University -- Dissertations.|
Freight and freightage -- Cost of operation.
Cargo handling -- Cost of operation.
|Department:||Department of Computing|
|Pages:||vii, 66 leaves : ill. ; 30 cm.|
|Abstract:||Currently, airfreight cargo is packed into ULDs, a type of container. The planning of this packing process is currently heavily dependent on expert knowledge. These experts must generally decide where to pack items of cargo into each ULD and in what order so as to achieve the most cost-effective use of space. However, in some areas of logistics and shipping, such as airfreight, the dimension and shape of a ULD may be variable and this creates the need for heuristics and algorithms that are able to cope with these variable dimensions so as to achieve cost-effective sequencing and positioning. A further difficulty is that freight-planning may be done either online or offline, that is, items may have to be packed as they arrive at the packing site or they may be packed only after all items have arrived. This dissertation responds to these problem by proposing extensions of three commonly used heuristics First Fit (specifically, First Fit Decreasing (FFD)), Best Fit (Best Fit Decreasing (BFD)) and Genetic Algorithms (GA). Our results show that our extension of GA produces a more cost-effective use of space than other two heuristics methods but that it's running time increases rapidly with the number of items of cargo to be packed. In contrast, BFD is more cost-effective than FFD and faster than GA. Finally, FFD is faster than either of the other two. The implication of this is that the choice of method will depend on the circumstances, FFD and BFD would have particular application to online freight cargo packing whereas GA is suitable for offline packing.|
Files in This Item:
|b21914412.pdf||For PolyU Staff & Students||6.3 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: