Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Cheng, Greenie | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/1252 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Agent-based airfreight planning system for IATA-compliant containers with bin packing heuristics and a genetic algorithm | en_US |
| dcterms.abstract | This dissertation aims to design an intelligent logistics system that supports the operations of a regional airfreight forwarding business with IATA-compliant containers. It utilizes the existing methods, such as the First-Fit and the Best-Fit heuristics, and a genetic algorithm to resolve the bin packing problem. Existing solutions on this type of problem are generally designed for two-dimensional rectangular items with relatively few restrictions regarding the physical placement; however, these approaches are insufficient for the airfreight forwarding industry. IATA-compIiant containers are restricted by the physical structure and form of an airplane; hence they have shapes that are relatively irregular to increase usable spaces. This leads to inefficient resource utilization when allocated with the generic approach. In our work, we explore the three-dimensional bin packing problem with irregular bins (IATA-compliant containers) and regular items (packages to be shipped). We aim to improve on the profits by always selecting a configuration that generates more profits by minimizing costs. In addition to the bin packing algorithms, the paper proposes using multi-agent systems and web services to extend this local problem onto a regional level. Through the communication module between the shipping centers, it provides a channel for information exchange and aims to optimize bin packing results in the global perspective. While the system achieves similar results in terms of costs for the three algorithms when experimented with a small sample data size, First-fit heuristic requires a significantly less amount of time for a large sample data size. Conversely, the genetic algorithm uses processing time in the unit of days and results with optimal configuration. Lies between the two algorithms are the best-fit heuristic. Although it consumes more time than the first-fit heuristic, its configuration optimization is comparable to that of the genetic algorithm at a much faster pace. | en_US |
| dcterms.extent | vi, 55 leaves : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2007 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations. | en_US |
| dcterms.LCSH | Aeronautics, Commercial -- Freight -- Data processing. | en_US |
| dcterms.LCSH | Aeronautics, Commercial -- Freight -- Planning. | en_US |
| dcterms.LCSH | Cargo handling -- Data processing. | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b21288689.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 7.14 MB | Adobe PDF | View/Open |
Copyright Undertaking
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:
https://theses.lib.polyu.edu.hk/handle/200/1252