Airport Surface Movement Scheduling with Route Assignment Using First-Come First-Served Approach

Park, Bae-Seon; Lee, Hyeonwoong; Kang, Seon Young; Lee, Hak-tae

doi:10.2514/6.2017-4259

Cited by 5 publications

(10 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Flight progression can be represented as a sequence of flight paths and simplified to a node-link structure. If a scheduling problem can be formulated into a node-link structure, the EFCFS scheduler can determine the earliest arrival and departure time of each flight with the given scheduling priority [1,2,6].…”

Section: A Extended First-come First-served Approachmentioning

confidence: 99%

“…The EFCFS scheduler can evaluate multiple taxi routes and select the best route for a given flight. In one of the previous studies [2], several cases were found where one of the alternate routes was chosen by the scheduler. However, this capability is not used for the current study.…”

Section: A Extended First-come First-served Approachmentioning

confidence: 99%

“…Table 1 lists all the common constraints implemented to both schedulers to solve the surface and terminal area scheduling problems. The first three constraints had already been implemented in the EFCFS scheduler in previous studies [1,2]. Two enhancements were made to the EFCFS scheduler to handle the last two constraints from Table 1.…”

Section: Compatibility Of the Two Algorithmsmentioning

confidence: 99%

“…Aircraft scheduling algorithms are one of the key components of this system. Inha University, a member of the consortium, is developing a scheduler based on a First-Come First-Served (FCFS) approach [1,2]. KARI is developing a scheduler using MILP through collaborative research with NASA [3,4].…”

Section: Introductionmentioning

confidence: 99%

“…Later, link constraints were added to solve Traffic Flow Management problems [6]. To apply this algorithm to aircraft surface movement problems at airports, constraints for link directionality and junction nodes were added, and the algorithm was tested using historic flight data and a node-link model of Incheon International Airport (ICN) [1,2]. Figure 1 shows the node-link model of ICN used for the current study.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Park

Lee

et al. 2018

2018 Aviation Technology, Integration, and Operations Conference

Self Cite

View full text Add to dashboard Cite

Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

show abstract

Section: A Extended First-come First-served Approachmentioning

confidence: 99%

Section: A Extended First-come First-served Approachmentioning

confidence: 99%

Section: Compatibility Of the Two Algorithmsmentioning

confidence: 99%