| Dynamic Air Route Open-Close Problem for Airspace Management |
| |
| 作者姓名： | 耿睿 程朋 |
| |
| 作者单位： | Department of Automation Tsinghua University，Department of Automation Tsinghua University，Beijing 100084 China，Beijing 100084 China |
| |
| 基金项目： | 清华大学智能技术与系统国家重点实验室开放性基金;国家高技术研究发展计划(863计划) |
| |
| 摘 要： | Dynamic airspace management plans and assigns airspace resources to airspace users on de- mand to increase airspace capacity. Although many studies of air traffic flow management (ATFM) have sought to optimally allocate air traffic to get the best use of given airspace resources, few studies have fo- cused on how to build an efficient air traffic network or how to adjust the current network in real time. This paper presents an integer program model named the dynamic air route open-close problem (DROP). DROP has a cost-based objective function which takes into account constraints such as the shortest occupancy time of routes, which are not considered in ATFM models. The aim of DROP is to determine which routes will be opened to a certain user during a given time period. Simulation results show that DROP can facilitate utilization of air routes. DROP, a simplified version of an air traffic network constructing problem, is the first step towards realizing dynamic airspace management. The combination of ATFM and DROP can facilitate decisions toward more reasonable, efficient use of limited airspace resources.
|
| 关 键 词： | 动力学 航空线路 领空管理 航天交通 |
| 收稿时间： | 2007-01-10 |
| 修稿时间： | 2007-06-25 |
Dynamic Air Route Open-Close Problem for Airspace Management |
| |
| Rui Geng, ,Peng Cheng, « .Dynamic Air Route Open-Close Problem for Airspace Management[J].Tsinghua Science and Technology,2007,12(6):647-651. |
| |
| Authors: | Rui Geng Peng Cheng « |
| |
| Institution: | aDepartment of Automation, Tsinghua University, Beijing 100084, China |
| |
| Abstract: | Dynamic airspace management plans and assigns airspace resources to airspace users on de- mand to increase airspace capacity. Although many studies of air traffic flow management (ATFM) have sought to optimally allocate air traffic to get the best use of given airspace resources, few studies have fo- cused on how to build an efficient air traffic network or how to adjust the current network in real time. This paper presents an integer program model named the dynamic air route open-close problem (DROP). DROP has a cost-based objective function which takes into account constraints such as the shortest occupancy time of routes, which are not considered in ATFM models. The aim of DROP is to determine which routes will be opened to a certain user during a given time period. Simulation results show that DROP can facilitate utilization of air routes. DROP, a simplified version of an air traffic network constructing problem, is the first step towards realizing dynamic airspace management. The combination of ATFM and DROP can facilitate decisions toward more reasonable, efficient use of limited airspace resources. |
| |
| Keywords: | air route open-close problem airspace management air traffic flow management integer programming |
| 本文献已被 CNKI 维普 万方数据 ScienceDirect 等数据库收录！ |
