#5692. An optimal data-splitting algorithm for aircraft sequencing on two runways

August 2026publication date
Proposal available till 23-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Civil and Structural Engineering;
Automotive Engineering;
Computer Science Applications;
Transportation;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №5692.1 Contract №5692.2 Contract №5692.3 Contract №5692.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
We study the static aircraft sequencing and scheduling problem (during peak hour) on a two independent runway system both under arrivals only and mixed mode of operations. This problem is formulated as a 0–1 mixed-integer program with the objective of maximizing the total throughput of both runways, taking into account several realistic constraints including safety separation standards, wide time-windows, and constrained position shifting. This NP-hard problem is computationally harder than its single runway counterpart due to the additional runway allocation decisions. Recognising the intractability of peak-traffic instances of this problem by direct application of the MIP formulation, a novel application of data-splitting algorithm (DS-ASP) is proposed to the case of two runways scenario. DS-ASP divides the given set of flights into several disjoint subsets, and then optimises each of them using 0–1 MIP while ensuring the optimality of the entire set.
Keywords:
0–1 mixed-integer programming; Aircraft sequencing problem; Data-splitting algorithm; Makespan; Multiple runways; Throughput

Contacts :
0