一类地面等待问题的离散时间系统求解方法_英文_

(Northwest Polytechnical University, Department of Automatic Control, Xian 710072, China)
Abstract: In recent years, congestion in air traffic degrades the performance of the air traffic system, raises safety concerns, and causes excessive costs. It is safer and less expensive to hold an aircraft on the ground than in the air; so, ground holding becomes one of the basic methods of curtailing congestion. In this paper we investigate a discrete event system method for solving the ground holding problem (GHP) with single destination airport, and design a static stochastic mathematics model. Considering practical flight schedule and the variety of weather, we explore our model associating with GHP’s stochastic character. We use Genetic Algorithms (GA) to solve our model in the operation. The simulation results show that our method and model are all useful to the air traffic flow management (ATFM). Keywords: flow management; ground holding problem; discrete event system; genetic algorithms
Introduction1
Nowadays, air traffic has increased dramatically while airport capacity has remained stagnant and large amounts of congestion are incurred at major airports throughout the world. According to the relate materials, the loss of American airways in 1990 are about $2.5 billion. In 1991, it is $2.0 billion. At the present time, annual estimator is about $3.5 billion. Similarly, in the last twenty years, Chinese air transportation developed with an unprecedented speed. Form 1984 to 1993, the growth of annual number of flights in China has increased by 13%. In 1997, the amount of airline is about 967 connecting one hundred and thirty five civil cities; the amount of airways is 485; the amount of airport is 141. Major congestion causes not only airways momentous loss and controllers’ heavy burden but also air traffic fatal danger. In terms of the planning horizon and considering time, solutions to the congestion problem vary from long-term to short-term. Long-term (over periods of 5-20 years) considerations involve building new airports and additional runways. Medium-term (on a planning horizon of six months or a year) approaches focus on ways that disperse traffic to less utilized airports through regulation, incentives, etc. Finally, short-term solutions aim minimizing the unavoidable delay costs under the current capacity and demand. One of the
Vol. 16 No. 10 Oct. 2004
王来军, 等：一类地面等待问题的离散时间系统求解方法
・ 2271・
not. On other word, the contents of MGHP are short-term planning management. At the early 1990’s, the object of GHP was not an entire network of airports but a single destination airport, that is to say, GHP at that time belongs to SGHP, until Vranas (1992) focused on the static MGHP[7]. From 1990’s to now, the more deeper and extensive disquisitions have been finished or evolved, such as Hoffman[6], Thomas[9]. To some extent, the conventional model of GHP is time-driven, which means that the times interested are subdivided into set of equal time intervals and one considers flights within these intervals. This method causes time deviations and computation complexity because of using linear programming or dynamic programming. Panayiotou and Cassandras (2001) proposed an event-driven method of solving SGHP[8]. The related method has been applied to industrial manufacture successfully, which is known as the discrete event system (DES). Analogously, if we take the ground holding program as a discrete event system, discrete event system approach could be used as a new means of solving GHP. In this paper, we address an event-driven approach for solving SGHP and extract a corresponding static stochastic mathematics model. In this approach, we consider flights within intervals of fixed length and take aircrafts’ arriving time as system input. Sometimes GHP is difficult to solve for the form of the objective function and the whole problem even remains unsolved due to the induced complexity. So, we introduce Genetic Algorithms (GA) that is adapted to this problem.
一类地面等待问题的离散时间系统求解方法
王来军, 史忠科
(西北工业大学自动化学院 空中交通管理系统研究所, 陕西 西安 710072)
摘 要：近年来，航空业迅速发展，空中交通拥挤现象凸现。地面等待是缓解这类现象的有效措施和方法。针对一 类目标机场容量随机的单机场地面等待问题，本文给出了问题的具体描述，建立了相应的离散事件系统模型，并在 此基础上设计了求解模型的遗传算法，分析了模型的复杂度和相关参数的特性，最后对算法进行了仿真验证。结果 表明，本文的离散事件系统模型及相应算法设计合理，可有效缩减总的消耗费用。相对普通的整数规划模型，本文 的离散事件系统模型能够给出具体的航班到场时刻和地面等待时间长度，有效消除了“时间碎片”引起的累积误差。 关键词：流量管理; 地面等待; 离散事件系统; 遗传算法 文章编号：1004-731X (2004) 10-2270-03 中图分类号：V 355 文献标识码：A