2005 9

:100026788 ( 2005) 0920119207

1 ,2

(11 , 710072 ;21 , 710064)

: , , ,
, ,
. , , , ,
.
: ; ; ;
: V355 : A

The Implement of Genetic Algorithms in Departure Sequencing Problem

WANG Lai2jun

1 ,2

, SHI Zhong2ke

(11School of Automatization , Northwestern Polytechnical University , Xi

an 710072 , China ;21School of Automobile ,Chang
an University ,
)
Xi
an 710064 ,China
Abstract : Mathematical model is build for solving the aircraft departure sequencing problem in this paper firstly.
Then , the genetic algorithm based on two type codes is established , and the related implement techniques are listed.
The improved adaptive probabilities of crossover and mutation are introduced in the genetic algorithm. Last , a
simulation is performed , and the result shows that the model and the algorithms are all effective. Method described in
this paper curtails the consumption of departure effectively , so , it has some merits in the field of airport operations and
air traffic control.
Key words : departure sequencing ; wake vortex separation ; global optimality ; genetic algorithm

, .
, , .
, ( ) , ,
, . NP2Hard .
[ 1 ] , , ,
. , ,
, .

1
,
.
, , .
. ,
, , ,
1 . , ,
.
,
:2004208213
: (60134010)
: (1976 - ) , , , , ; ( 1956 - ) , , ,
, ,
.
1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

120

2005 9

. , , ( )
. , , . ,
:
, .
, , , ;
, .
, , ,
. ,
.

2
, :
N

min C =

( d

- di - 1 ) = dN - d0 ,

( 1)

i =1

, N , di i , d0
, dN .
, :
di - di - 1 max ( m i , i - 1 , w i , i - 1 ) , i = 1 , , N ,

( 2)

mi , i - 1 ( miles2in2trail separation) , w i , i - 1 (wake vortex separation) .

, , , ( 2) . i , i + 1
i i + 1 , i , i + 1 = max ( mi , i + 1 , w i , i + 1 ) , ( 1) :
N- 1

min C =

i , i +1

( 3)

i =1

, :
k

dj - dj - 1 0 , j = 1 , , N k ; k = 1 , , K.
k
j

d , d

k
j- 1

( 4)

k ( k )
K

, N k k . K ( K ) ,

= N .

k=1

, ( 4) :
1 , .
, 1 , :
K

1 K N !

( N

!) . , N k

k=1

k , N .

3
, ,
1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

121

,. , ,
,. 1 , ,

[2]

, , , . ,

( 1
)
. ,
,
2

;
.
.
1)
,
,. ,
. , 1 1 , 2 2 , M
1 N 2 , M 1 N 2 ,

M + N . , 1 M 1 A 1 , A 2 , , A M , 2 N 2 B 1 , B 2 ,
, B N .
2)

, , ,
, 1.
1
2
1
2 , Gx = ( g x , g x ,
M+ N

, gx

) Gy = ( g1y , g2y , , gMy + N ) , :

STEP 1 i , i + 1

;
p

STEP 2 p ( p = i + 1 , i + 2 , , M + N ) , gx = gy , ; gx
p

gy , Gx , gx = gy q , Gy , gy = gx r ,
q

gx gx gy gy ,.
, : ,
,
,1
2
. ,
Gx Gy , , G
x G
y , .

3)

1
2
,
1
2
,. :
( 1 1 2 1 2 2 2 1 2 1 2) = G
Gx = ( 1 2 2 1 2 1 2 1 2 1 2)
x
4)
.
5)
M+ N - 1

F ( S) = ( M + N)

( 5)

i , i +1

i =1

M+ N - 1

, i , i + 1 i i + 1 , i , i + 1 = max ( mi , i + 1 , w i , i + 1 ) . ,

i , i +1

i =1

.
6)
,. ,
. : 0 ,
1 , ,
1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

122

2005 9

, ,
.
7)
, ,
. , , ,
Pc Pm . [ 3 ] , Pc Pm ,
. , , . ,
, , , Pc Pm , ;
, , Pc Pm ,
. ,.
a. :
( 6)

Pc = wc1 Pc1 + wc2 Pc2 ,

, w c1 wc2 ; Pc1 Pc2 :

0 G < Gc1

Pc11 ;
Pc1 =

( Pc11 - Pc21 )

G - Gc1
+ Pc21 ;
Gc2 - G

exp - c1

( 7)

Gc2 < G GM

Pc21 ;
Pc12 ;
Pc2 =

Gc1 G Gc2

F < Favg

( Pc12 - Pc22 )

F - Favg
+ Pc22 ;
Fmax - F

exp - c2

F Favg

( 8)

b. :
( 9)

Pm = w m1 Pm1 + w m2 Pm2 ,

, w m1
w m2 ; Pm1 Pm2 :
0 G < Gm1

Pm11 ;
Pm1 =

( Pm11 - Pm21 )

G - Gm1
+ Pc21 ;
Gm2 - G

exp - m1

(10)

Gm2 < G GM

Pm21 ;
Pm12 ;
Pm2 =

Gm1 G Gm2

F < Favg

( Pm12 - Pm22 )

F - Favg
+ Pm22 ;
Fmax - F

exp - m2

F Favg

(11)

( 6) ( 11) , Fmax ; Favg ; F

c2 m1
m2 0 ,
; c1
; Gc1 Gc2 Gm1 Gm2 , Pc11 Pc21 Pc12 Pc22 , Pm11 Pm21 Pm12 Pm22 ,
: Gc1 = Gm1 = 50 , Gc2 = Gm2 = 200 , Pc11 = 018 , Pc21 = 015 , Pm11 = 0105 , Pm21 = 010005 , Pc12 = 0199 , Pc22 = 016 ,
Pm12 = 011 , Pm22 = 01001.

, :
STEP 1 . , ;

( Gc1 , Gc2 , Gm1 , Gm2 , Pc11 , Pc21 , Pc12 , Pc22 , Pm11 , Pm21 , Pm12 , Pm22 ) ;
G = 0 ; X i = [ x i ,1 , x i ,2 , , x i , n ] , P i = 1 ,2 , , POPSIZE ,
0

P ( 0) ,
M+ N

j =1

x i ,j = 1

x i ,j = 2

P i = 1 ,2 , , PO PS I Z E ;

1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

123

STEP 2 Fi P i = 1 ,2 , , POPSIZE , 6 , ,
Gen = Gen + 1 ;
STEP 3 , P ( Gen + 1) P( Gen) ;
STEP 4 P( Gen ) Xi , ( 6)
Pc ; , Pc = 0199. 2 , , P( Gen) ;
STEP 5 P( Gen ) Xi , ( 7)

, ; , Pm = 011 , . P( Gen) ;
STEP 6 . Gen = MAXGENS , Ne , ;

, STEP 2 ;
STEP 7 , .
[4 ]
, ,
.

4
411

4 , ( H)
(L )
(M) ( S) ,
, , .
.
1

1. 2m

2. 0m

3. 0m

5. 0m

1. 0m

1. 0m

1. 2m

1. 5m

0. 8m

0. 8m

1. 0m

1. 2m

0. 5m

0. 5m

0. 8m

1. 0m

, . ,
. Vb610 , CPU 211G ,
.
, ,
, 20 . , ,
. , .
2
1

10

11

12

13

14

15

16

17

D1

D2

412

, ,
. , , ,
. , , .

1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

124

2005 9

( m)

1 ( m)

2 ( m)

D1 (1)

D1 (1)

D1 (2)

1. 2

D1 (2)

1. 2

2. 2

D2 (1)

D2 (1)

D2 (2)

D1 (3)

D1 (3)

D1 (4)

4. 2

D2 (3)

D2 (2)

5. 8

D1 (4)

6. 2

D1 (5)

6. 2

10. 8

D1 (5)

7. 2

D2 (3)

11. 8

D1 (6)

8. 2

D1 (6)

8. 2

12. 8

D2 (4)

8. 7

D1 (7)

8. 7

13. 8

D1 (7)

9. 9

D2 (4)

9. 9

14. 8

D1 (8)

12. 9

D1 (8)

12. 9

15. 3

D1 (9)

14. 1

D1 (9)

14. 1

18. 3

D1 (10)

14. 9

D1 (10)

14. 9

19. 1

D2 (5)

16. 1

D2 (5)

16. 1

24. 1

D1 (11)

16. 6

D1 (11)

16. 6

24. 9

D1 (12)

17. 8

D1 (12)

17. 8

25. 7

D1 (13)

19

D1 (13)

19

27. 7

D1 (14)

19. 8

D2 (6)

20

28. 9

D1 (15)

21

D1 (14)

20. 8

30. 1

D2 (6)

22

D1 (15)

22

30. 9

D1 (16)

22. 5

D1 (16)

22. 5

32. 1

D2 (7)

23. 7

D2 (7)

23. 7

32. 6

D1 (17)

28. 7

D1 (17)

28. 7

37. 6

D2 (8)

29. 2

D2 (8)

29. 2

,
,
,
.
, [ 1 ] . ,
,
, .

, , 2 .

. 2 , :
,

1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net

125

, ; , ,
, , ;
, ,
.

5
, ,
. , , ,
.
:
[1 ] Bolender M A. Scheduling and Control Strategies for the Departure Problem in Air Traffic Control [ D ] . America : University of
Cincinnati , 2000.
[2 ] .
[M] . : , 1999.
Lu Kaicheng. Single2objective , Multi2objective and Integer Programming [M] . Beijing : Tsinghua University Press , 1999.
[3 ] Srinivas L ,Patnaik M. Adaptive probabilities of crossover and mutation in genetic algorithm[J ] . IEEE Trans. on SMC , 1994 ,24
(4) :656 - 667.
[4 ] , . [M] . : , 2002.
Zhou Ming ,Sun Shudong. Genetic Algorithms Theory and Applications [M] . Beijing : Defence Industry Press , 2002.

( 104 )
[10 ] . [M] . : ,2001 :195 - 211.
WANGLing. Intelligent Optimization Algorithms with Applications[M] . Beijing : Tsinghua University Press , 2001 :195 - 211.
[11 ] , , . TSP [J ] . ,1999 ,25 (3) :425 - 428.
GAO Guohua , SHEN Lincheng , CHANG Wensen. Using simulated annealing algorithm with search space sharpening to solve
traveling salesman problem[J ] . Acta Automatica Sinica , 1999 ,25 (3) :425 - 428.
[12 ] , , , . [M] . : ,1994 :150 - 151.
KANGLishan , XIE Yun , YOU Shiyong et al. Simulated Annealing Algorithm[M] . Beijing : Science Press , 1994 :50 - 97.
[13 ] , , . TSP [J ] . ,2002 ,38 (8) :58 - 60.
XIE Shengli , TANG Min , DONG Jinxiang. An improved genetic algorithm for TSP problem [ J ] . Computer Engineering and
Applications , 2002 ,38 (8) :58 - 60.
[14 ] , , . CTSP[J ] . ,2000 ,17 (9) :52 - 55.
YU Di , LINGJie , XIE Xiaofeng. Solving CTSP with genetic algorithm[J ] . Journal of Guangdong University of Technology , 2000 ,
17 (9) :52 - 55.
[15 ] . [M] . : ,1994 :97 - 98.
ZHANGLiming. Models and Applications of Artificial Neural Networks[M] . Shanghai : Fudan University Press ,1994 :97 - 98.
[16 ] . [M] . : ,1994 :97 - 101.
HUA Shan. Computer Science Math[M] . Harbin : Harbin Shipbuilding Institute Press , 1994 :97 - 101.
[17 ] . MATLAB [J ] . ,2002 ,18 (8) :52 - 54.
GAO Shang. Optimization computeing base on the genetic algorithm optimization toolbox in Matlab[J ] . Microcompter Application ,
2002 ,18 (8) :52 - 54.

1994-2009 China Academic Journal Electronic Publishing House. All rights reserved.

http://www.cnki.net