A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

Sadovsky, A ; Windhorst, R

关键词: AIR TRAFFIC CONTROL;    AIRLINE OPERATIONS;    ALGORITHMS;    FLOW DISTRIBUTION;    HEURISTIC METHODS;    MANAGEMENT SYSTEMS;    NATIONAL AIRSPACE SYSTEM;    NETWORK ANALYSIS;    PRIORITIES;    ROUTES;    SCHEDULES;    STANDARDIZATION;    STRUCTURAL DESIGN;   

RP-ID  :  ARC-E-DAA-TN72810

学科分类：航空航天科学

美国|英语

来源: NASA Technical Reports Server

【 摘 要 】

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.