Scientific Journal of Control Engineering

June 2013, Volume 3 Issue 3, PP.138-146

Online Aircraft Landing Scheduling with

Dynamic Adjustment Strategy
Xie Zhang 1, 2#, Hongzhi Liu 1
1. College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China
2. Key Lab of Operation Programming and Safety Technology of Air Traffic Management, Tianjin 300300, China
#

Email: xiezhang@cauc.edu.cn

Abstract
Researches on Aircraft Landing Scheduling (ALS) have great significance for relief of air traffic congestion, reduction of flight
delay, enhancement of flight safety, advancement of air traffic service system efficiency and improvement of flight benefit. ALS is
a typical combinatorial optimization problem, and the existence of such complex multi-constraint makes it an intractable problem.
Additionally, the difficulty in seeking the solutions is increased by the real-time requirement. Therefore, it hasnt been completely
solved probably. For the online case, two different approaches, slot insertion and minimum quantity, for sequencing of the late
aircraft and three different solutions, circling holding, slot insertion, and delay equivalent, for the early aircraft are presented,
implemented and verified with simulations. A large number of experiments show that the cost of calculation has been greatly
reduced, and the scheduling results can take into account both real-time and continuity.
Keywords: Air Traffic Management; Aircraft Landing Scheduling; Dynamic Adjustment Strategy; Online Scheduling

*
1, 2 1, 2
1. 300300
2. 300300

NP-C [1]

[2-6]
[2-4]
*

61039001(2011kyE042012QD04X)
- 138 http://www.sj-ce.org/

[7]Beasley

[7]
[8-10]

[10]

1.1

[11]

- 139 http://www.sj-ce.org/

1.2
1)
2)
3) +30

1.3

F i F
ETAi i
STAi i
PCi i
ACi
DCi
C
ARi i
XPi i
Ei Li i
TAmax
TDmax
Th
YRi i
Z ij Z ij 1 i j Z ij 0
1.4

min f DTi DCi PCi DTi ACi PCi DTi C

(1)

iF

1, x 0
0, x 0

( x)

(1) DTi STAi ETAi , DTi 0 DTi 0

DTi 0 DCi PCi ACi PCi

1.5
1.5.1

1, STAi STAj

0, STAi STAj

ij

ij ji 1, i j ;

(2)

(2) ij i j ij 1 i j ij 0
- 140 http://www.sj-ce.org/

 i j
1.5.2

if ij 1 then STAj STAi MSSij ij , i j ;

(3)

i j MSSij
ij ij MSSij 1
H M L

1
1

1.5.3

94

157

196

60

69

131

60

69

82

4km
40
1
40
if ij 1 and Z ij 1 then STAj STAi MSSij ij , i j ;
if ij 1 and Zij 0 then STA j STAi 40 ij , i j ;

(4)
(5)

(4) i j (5) i j
MSSij 40
1.5.4

[10]

k
(6)(7)
if ARi AR j 0 and ETAi ETA j then STAi STA j , i j ;

XPi i k , i 1, 2,..., m
- 141 http://www.sj-ce.org/

(6)
(7)

1.5.5

(8)

(9)N

STAi ETAi TAmax , ETAi TDmax

STAi ETAi TAmax , ETAi TDmax NTh

(8)
(9)

2.1
1)

1
196s 200s 1

2)
1
2 3

2.2
1)

2)

3)

2.3
0 n m
m CPS

k m 1 ~ m k m k 1 ~ m k
k m k 1 ~ m k k [12] k
m
[12,13]

1~10s [14]
4
- 142 http://www.sj-ce.org/

2.4
[12] 2k
k

k C 2 k
k
2k

L 167 2 40

k
2k

r 1

C 3 C

L
r

[13]
r
k
3
2r
n 22707 rC2 k L Balakrishnan

m x 1 [ t1 , t2 ] t1 ETAx t2
x [ t1 , t2 ] m 1

ETAx ETAx ETAx

t1 ~ ETAx
t1 ~ ETAx t1 ETAx ( ETAx t1 ) / 2
ETAx t1 t1

100

100 100

(H, M, L)=(0.3, 0.5, 0.2) 4 100

3.1
2

2 (k=2)

ms

20

16.30%

10593.57

20

15.69%

158.42

40

18.43%

38662.51

40

17.72%

483.12

3
k 123
k 70
k 3 2.53
- 143 http://www.sj-ce.org/

k=1

ms

k=2

ms

k=3

ms

10

14.77%

34.13

15.56%

33.45

15.69%

114.39

20

14.70%

36.93

15.39%

129.17

15.72%

461.58

30

16.14%

44.31

16.64%

219.96

16.86%

779.16

40

16.21%

59.03

17.46%

301.53

17.75%

1073.56

50

16.78%

92.52

18.36%

478.38

18.75%

1662.35

60

19.15%

120.42

20.49%

601.78

20.62%

2088.39

70

19.49%

150.70

21.08%

731.61

21.27%

2532.83

3.2
20 k 3 2

3.2.1

1 32864C 2 33815C
3.2.2

4 1 1
alpha

0.3

0.6

0.9

1.2

1.5

1.8

2.1

28857 C

28146 C

27623 C

27031 C

26229 C

25880 C

25619 C

30384 C

30051 C

29885 C

29304 C

29470 C

28889 C

28391 C

5 1 2
alpha

0.3

0.6

0.9

1.2

1.5

1.8

2.1

27934 C

26708 C

25832 C

25482 C

25596 C

24957 C

24896 C

28742 C

28494 C

28338 C

27751 C

27586 C

27256 C

26760 C

6 1 3
alpha

0.3

0.6

0.9

1.2

1.5

1.8

2.1

26733 C

26389 C

24927 C

24841 C

23724 C

23446 C

22435 C

28553 C

27792 C

26836 C

26778 C

25765 C

25342 C

25004 C

2 1
i

28133 C

27631 C

27614 C

26921 C

26834 C

29304 C

29470 C

28889 C

28391 C

8 2 2
i

26224 C

25872 C

25784 C

25432 C

25265 C

29138 C

28967 C

28625 C

28113 C

- 144 http://www.sj-ce.org/

 9 2 3
i

22930 C

22684 C

21856 C

27137 C

26493 C

25849 C

alpha alpha 1

200s
60s 0.3 0.3 alpha

3 1 2

100

REFERENCES
[1]

J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, et al. Scheduling aircraft landings - the static case[J]. Transportation Science,
2000, 34(2): 180-197

[2]

H. Pinol, J. Beasley, Scatter search and bionomic algorithms for the aircraft landing problem[J]. European Journal of Operational
Research, 2006, 171(2): 439-462

[3]

X. Hu, E.D. Paolo. Binary-Representation-Based Genetic Algorithm for Aircraft Arrival Sequencing and Scheduling[J]. IEEE
Transactions on Intelligent Transportation Systems, 2008, 9(2): 301-310

[4]

X. Hu, E.D. Paolo. An efficient genetic algorithm with uniform crossover for air traffic control[J]. Computers and Operations
Research, 2009, 36(1): 245-259

[5]

Z.H. Zhan, J. Zhang, Y. Li. An Efficient Ant Colony System Based on Receding Horizon Control for the Aircraft Arrival
Sequencing and Scheduling Problem[J]. IEEE Transactions on Intelligent Transportation Systems, 2010, 11(2): 399-412

[6]

Y. Eun, I. Hwang, H. Bang. Optimal Arrival Flight Sequencing and Scheduling Using Discrete Airborne Delays[J]. IEEE
Transactions on Intelligent Transportation Systems. 2010, 11(2): 359-373

[7]

J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, et al. Displacement problem and dynamically scheduling aircraft landings[J].
Journal of the Operation Research Society, 2004, V55: 54-64

[8]

X. Hu, W. Chen. Receding Horizon Control for Aircraft Arrival Sequencing and Scheduling[J], IEEE Transactions on Intelligent
Transportation Systems, 2005, 6(2): 189-197

[9]

Y. Guo, X. Cao, J. Zhang. Multiobjective Evolutionary Algorithm with Constraint Handling for Aircraft Landing Scheduling[C]//
Proceedings of 2008 IEEE Congress on Evolutionary Computation. Hong Kong: IEEE Press, 2008: 3657-3662

[10] X. Zhang, X.J. Zhang, J. Zhang, et al. Optimization of Sequencing for Aircraft Arrival Based on Approach Routes[C]//
Proceedings of the 10th International IEEE Conference on Intelligent Transportation Systems. Seattle: IEEE Press, 2007: 592-596
[11] H. Lee, H. Balakrishnan. Fuel Cost, Delay and Throughput Tradeoffs in Runway Scheduling[C]// Proceedings of the American
- 145 http://www.sj-ce.org/

Control Conference. Seattle: IEEE Press, 2008: 2449-2454

[12] D.A. Trivizas. Optimal Scheduling with Maximum Position Shift (mps) Constraints: A Runway Scheduling Application[J].
Journal of Navigation. 1998, 51(2): 250-266
[13] H. Balakrishnan, B. Chandran. Efficient and Equitable Departure Scheduling in Real-time: New Approaches to Old Problems [C]//
USA/Europe Air Traffic Management R and D Seminar, 2007
[14] B. Chandran, H. Balakrishnan. A Dynamic Programming Algorithm for Robust Runway Scheduling[C]// Proceedings of the 2007
American Control Conference. New York: IEEE Press, 2007: 1161-1166

1981-

1980-

Email: xiezhang@cauc.edu.cn

Email: hzliu@cauc.edu.cn

- 146 http://www.sj-ce.org/