Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | en_US |
| dc.contributor.advisor | Lee, K. M. Carman (ISE) | - |
| dc.contributor.advisor | Chan, T. S. Felix (ISE) | - |
| dc.creator | Ng, Kam Hung | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/10207 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Robust optimisation approaches to airside operations in terminal manoeuvring areas | en_US |
| dcterms.abstract | The impact of sustainable growth in the traffic volume of civil aviation has significantly influenced traffic delay by outstripping capacities of air and airport traffic resources. Robust optimisation to airside operations offers a perspicacious and holistic surveillance for flight activities in a near-terminal manoeuvring area and this study focuses on the treatment of uncertainty in developing a resolution of airborne and airport traffic control. Further, the advancement of computational intelligence in operations research assures a real-world problem becomes computationally tractable. The solution quality derived from the state-of-the-art mathematical programming, meta-heuristics and matheuristics regarding convergence performance has been seen to greatly improve. This thesis contributes to the theoretical development in the research field of robust optimisation, optimisation methods and matheuristic. In the first part of the thesis, we will provide a review of meta-heuristic approaches for airside operations research. We present a comprehensive analysis of the literature review of airside operations research and meta-heuristics approach. This unifying survey synthesises the current research progress in airside operations and highlights the benefits of sophisticated modelling and an integrated approach. In the second part of the thesis, we focus on attention to constructing the robust optimisation approaches and various optimisation methods for terminal traffic flow problems considering real-world scenarios. First, we developed a robust aircraft sequencing and scheduling problem using min-max regret criterion with mixed-mode runway configuration. We aimed to alleviate the effect of aggregate delays given that the arrival and departure time of flights is not perfectly determined and the probability distribution of delay cannot be estimated in advance. Second, we proposed a novel alternative path approach for robust terminal traffic flow problem using a min-max criterion by addressing the uncertain transit time. Third, we further extended the alternative path approach for robust terminal traffic flow problem using a light robustness approach. | en_US |
| dcterms.extent | xx, 238 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2019 | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.LCSH | Airports -- Traffic control | en_US |
| dcterms.LCSH | Airports -- Planning | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 991022289514903411.pdf | For All Users | 3.54 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/10207