原文传递 Configuring Airspace Sectors with Approximate Dynamic Programming
题名: Configuring Airspace Sectors with Approximate Dynamic Programming
作者: Bloem, Michael; Gupta, Pramod
关键词: programming;sector;dynamic;airs;prox;onfi;space;imate;ring;with
摘要: In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2%of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15%on average with an acceptable computation time.
报告类型: 科技报告
检索历史
应用推荐