Journal of Transportation Systems Engineering and Information Technology ›› 2010, Vol. 10 ›› Issue (6): 174-179 .

• Systems Engineering Theory and Methods • Previous Articles     Next Articles

Research of Miles-In-Trail Strategy in Sector Boundary Based on Genetic Algorithm

SUN Hao; HU Ming-hua; ZHANG Ying   

  1. School of Civil Aviation, Nanjing University of Aeronautics & Astronautics, Nanjing 210016, China
  • Received:2010-06-05 Revised:2010-09-11 Online:2010-12-25 Published:2010-12-25
  • Contact: HU Ming-hua

基于遗传算法的扇区边界尾随间隔管理方法的研究

孙浩;胡明华*;张颖   

  1. 南京航空航天大学 民航学院,南京 210016
  • 通讯作者: 胡明华
  • 作者简介:孙浩(1986-),男,江苏扬州人,硕士生.

Abstract: For the lack of M.I.T currently implements in China, which is entirely generated according to controllers’ experience, this paper, on the basis of the existing forecasting and flow management and the custom of controllers, proposes a method of Miles-In-Trail strategy in sector boundary based on genetic algorithm. In order to obtain the maximum flow in the control period on condition of the matching between flow and storage capacity, this paper establishes the integer programming model of M.I.T strategy in sector boundary and algorithm based on genetic algorithm, meanwhile, puts forward the concepts of sector acceptance ability in sector, and then verify the practicability of the model by using the specific example. The results show that this method is practicable, because it can make full use of the storage capacities of the sector to the maximum extent,and can be according to the custom of controllers, avoiding the probability of saturation of the sector.

Key words: air transportation, intelligent transportation, flow management, Miles-In-Trail, genetic algorithm

摘要: 针对国内目前实行的完全依据管制员经验生成尾随间隔(MIT)的不足,在现行统计预测和流量管理的基础上,提出一种基于遗传算法的扇区边界尾随间隔管理的方法. 在流量与容量匹配的前提下,基于实际管制的规则和习惯并加以改进,以控制时段内的流量大小为性能指标,建立了以扇区边界尾随间隔的整数规划数学模型和基于遗传算法的尾随间隔算法,同时在模型中提出扇区接收能力等概念,最后通过实例对模型进行实用性验证. 结果表明:执行该尾随间隔管理方法生成的尾随间隔值后,在避免了可能会发生的扇区饱和的同时,最大程度利用了空域容量,并符合实际管制要求,证明该方法实用可行.

关键词: 航空运输, 智能交通, 流量管理, 尾随间隔管理, 遗传算法

CLC Number: