| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | - |
| dc.creator | Ng, KKH | - |
| dc.creator | Lee, CKM | - |
| dc.creator | Chan, FTS | - |
| dc.creator | Chen, CH | - |
| dc.creator | Qin, Y | - |
| dc.date.accessioned | 2021-05-13T08:32:31Z | - |
| dc.date.available | 2021-05-13T08:32:31Z | - |
| dc.identifier.issn | 1568-4946 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/89899 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Benders cuts selection scheme | en_US |
| dc.subject | Dynamic relative interior point | en_US |
| dc.subject | Robust optimisation | en_US |
| dc.subject | Terminal traffic flow problem | en_US |
| dc.title | A two-stage robust optimisation for terminal traffic flow problem | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 89 | - |
| dc.identifier.doi | 10.1016/j.asoc.2019.106048 | - |
| dcterms.abstract | Airport congestion witnesses potential conflicts: insufficient terminal airspace and delay propagation within scrambled the competition in the terminal manoeuvring area. Re-scheduling of flights is needed in numerous situations, heavy traffic in air segments, holding patterns, runway schedules and airport surface operations. Robust optimisation for terminal traffic flow problem, providing a practical point of view in hedging uncertainty, can leverage the adverse effect of uncertainty and schedule intervention. To avoid delay propagation throughout the air traffic flow network and reduce the vulnerability to disruption, this research adopts a two-stage robust optimisation approach in terminal traffic flow. It further enhances the quality of Pareto-optimality Benders-dual cutting plane based on core point approximation in the second stage recourse decision. The efficiency of the cutting plane algorithm is evaluated by a set of medium sized real-life scenarios. The numerical results show that the proposed scheme outperforms the well-known Pareto-optimal cuts in Benders-dual method from the literature. | - |
| dcterms.accessRights | embargoed access | - |
| dcterms.bibliographicCitation | Applied soft computing, Apr. 2020, v. 89, 106048 | - |
| dcterms.isPartOf | Applied soft computing | - |
| dcterms.issued | 2020-04 | - |
| dc.identifier.scopus | 2-s2.0-85078565773 | - |
| dc.identifier.eissn | 1872-9681 | - |
| dc.identifier.artn | 106048 | - |
| dc.description.validate | 202105 bcvc | - |
| dc.description.oa | Not applicable | - |
| dc.identifier.FolderNumber | a0768-n18 | - |
| dc.identifier.SubFormID | 1587 | - |
| dc.description.fundingSource | Others | - |
| dc.description.fundingText | RU8H | - |
| dc.description.pubStatus | Early release | - |
| dc.date.embargo | 2022.04.30 | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Access
View full-text via PolyU eLinks 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.