A new multiple flights routing and scheduling algorithm in terminal manoeuvring area

Simple item page
dc.contributor.authorBae, Sangjun
dc.contributor.authorShin, Hyo-Sang
dc.contributor.authorLee, Chang-Hun
dc.contributor.authorTsourdos, Antonios
dc.date.accessioned2019-01-28T11:44:52Z
dc.date.available2019-01-28T11:44:52Z
dc.date.issued2018-12-10
dc.description.abstractWe address multiple flights planning problems from its initial waypoint to its destination while satisfying the minimum separation requirement between each aircraft at all times in a Terminal Manoeuvring Area (TMA) to maintain or increase runway throughput. Due to operational constraints for safety, most of the current aircraft fly over or by waypoints, and along nominal routes in the airspace. Where the waypoints and routes in the airspace can be modelled as a weighted digraph, called airspace graph. We propose a problem that consists of determining a flight path (routing problem) and its speed profile (scheduling problem) in a given airspace graph in which a time-based weighting scheme of the airspace graph is proposed to reflect a speed-limitation-compliant schedule that satisfy the minimum separation requirement. For multiple flights cases, the flight paths and schedules are obtained by iteratively solving the problem for each flight by applying the First Come First Served (FCFS) algorithm to determine an arrival sequence. The main contributions of this paper are increasing a solution search space by solving two problems simultaneously, efficient computational time, and providing the separation-compliant flight path and speed profile within the speed limitation for each flight. We demonstrate the advantages of the proposed approach through a case study in which multiple flights arrive at a single airport, and we compare the results with Regulated Tactical Flight Model (RTFM) obtained from EUROCONTROL Demand Data Repository 2 (DDR2). Although, we consider only a single airport and make an assumption to simplify flight routes from holding stacks to a Final Approach Fix (FAF), the results show the potential usage of the proposed algorithm as a Decision Support Tool (DST) for Air Traffic Controllers (ATCOs) if the following considerations are taken into account: detailed routes-based flights after the holding stacks, multiple airports, departing aircraft, all possibe aircraft types, and uncertainties produced by external sources.en_UK
dc.identifier.citationSangjun Bae, Hyo-Sang Shin, Chang-Hun Lee and Antonios Tsourdos. A new multiple flights routing and scheduling algorithm in terminal manoeuvring area. Proceedings of the 2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC), 23-27 September 2018, London UK.en_UK
dc.identifier.isbn978-1-5386-4112-5
dc.identifier.issn2155-7209
dc.identifier.urihttps://doi.org/10.1109/DASC.2018.8569239
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/13858
dc.language.isoenen_UK
dc.publisherIEEEen_UK
dc.rightsAttribution-NonCommercial 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/*
dc.titleA new multiple flights routing and scheduling algorithm in terminal manoeuvring areaen_UK
dc.typeConference paperen_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
multiple_flights_routing_and_scheduling_algorithm-2018.pdf
Size:
954.76 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SATM)