原文传递
Simulation Study of Bin-and-Sort Policies in a Distributed System for Flights Scheduling.
| 题名： | Simulation Study of Bin-and-Sort Policies in a Distributed System for Flights Scheduling. |
| 作者： | A. Sadovsky, R. Windhorst##J. Phillips, Y.-C. Chu |
| 摘要： | This is a report on the results of a simulation experiment conducted on an automated distributed system for scheduling flights in a shared airspace. The scheduling is carried out by computer systems owned by the private operators of the flights, which interface through a centralized independent server. The scheduling requires determining which of the group of flights at hand (whether owned by the same operator or different ones) are to have the advantage of being scheduled before the others. A chosen method of grouping and prioritizing flightsmust: havetheabilitytoscheduleaflightpromptly, preventschedulingconflictsbetween pairs of overlapping flight routes, and be computationally feasible. Scheduling flights one by one is the First Come First Served policy. Scheduling too many at a time is infeasible. The type of scheduling policy proposed herein, called bin-and-sort, is an attempt to reach a compromise between these two extremes. Bin-and-sort allows for each operator to choose its criteria for prioritizing its flights, and for the centralized component to use different arbitration criteria. A number of these criteria are used in the simulation presented herein. The results of each criterion choice are reported and analyzed. |
| 总页数： | 10 |
| 报告类型： | 科技报告 |
| 发布日期： | 2021 |
相关文献
- Distributed Optimization in Aircraft Mission Scheduling.
- Distributed Planning and Control for Applications in Transportation Scheduling.
- Distributed Optimization for Customized Aircraft Fleet Scheduling.
- Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System.
- Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System.
检索历史
应用推荐
