先验与后验
数学优化
计算机科学
流量网络
流量(数学)
控制理论(社会学)
运筹学
数学
控制(管理)
哲学
几何学
认识论
人工智能
作者
Giovanni Andreatta,Giorgio Romanin-Jacur
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1987-11-01
卷期号:21 (4): 249-253
被引量:120
标识
DOI:10.1287/trsc.21.4.249
摘要
Airport congestion is one of the main causes of costly aircraft delays. Sometimes costs may be reduced by imposing on some aircraft a delay at take off time in order to later avoid a more expensive airborne delay. The objective of the Flow Management Problem (F.M.P.) is to find an optimal delay strategy so that the total expected delay cost is minimized. In this paper an idealized and greatly simplified version of F.M.P. is investigated. In particular the airways network considered is star-shaped and congestion is allowed only in the central (arrival) airport. For this particular version a model is presented and a polynomial solution algorithm is derived. Landing priorities among aircraft can also influence the total expected delay cost: the optimal priority rule for our version of the F.M.P. is derived. Another algorithm is presented for the case where the number of aircraft not to be delayed on the ground is given a priori. Possible extensions of the proposed model to more realistic situations are mentioned.
科研通智能强力驱动
Strongly Powered by AbleSci AI