Research on MPS Optimization to Landing Schedule Problem

Jiang YU;Xiao Ming LIU;Yun PU

Systems Engineering - Theory & Practice ›› 2004, Vol. 24 ›› Issue (3) : 119-122.

PDF(135 KB)
PDF(135 KB)
Systems Engineering - Theory & Practice ›› 2004, Vol. 24 ›› Issue (3) : 119-122. DOI: 10.12011/1000-6788(2004)3-119
论文

Research on MPS Optimization to Landing Schedule Problem

  • Jiang YU(1),Xiao Ming LIU(2),Yun PU(1)
Author information +
History +

Abstract

This paper presents an efficient optimization algorithm and complicated code for Airciraft Landing Scheduling Problem,Based on Depth-first-search implicit emumeration algorithm,subject to MPS limiting,position lock limiting and optimization depth limiting. This algorithm can apply to any real complicated ATC enviroment with flexible goal cost function,and static or dynamic real-time ATC automation system,to minimize traffic delay and improve landing capacity.

Key words

implicit emumeration algorithm / air traffic flow management / travelling sales man problem / ATC automation system /

Cite this article

Download Citations
Jiang YU , Xiao Ming LIU , Yun PU. Research on MPS Optimization to Landing Schedule Problem. Systems Engineering - Theory & Practice, 2004, 24(3): 119-122 https://doi.org/10.12011/1000-6788(2004)3-119
PDF(135 KB)

303

Accesses

0

Citation

Detail

Sections
Recommended

/