TY - JOUR
T1 - A two-stage robust optimisation for terminal traffic flow problem
AU - Ng, Kam Hung
AU - Lee, Ka Man
AU - Chan, Tung Sun
AU - Chen, Chun-Hsien
AU - Qin, Yichen
PY - 2020/4/1
Y1 - 2020/4/1
N2 - 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.
AB - 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.
KW - Benders cuts selection scheme
KW - Dynamic relative interior point
KW - Robust optimisation
KW - Terminal traffic flow problem
UR - https://www.sciencedirect.com/science/article/pii/S1568494619308300
UR - http://www.scopus.com/inward/record.url?scp=85078565773&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2019.106048
DO - 10.1016/j.asoc.2019.106048
M3 - Journal article
VL - 89
JO - Applied Soft Computing
JF - Applied Soft Computing
SN - 1568-4946
M1 - 106048
ER -