期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 276, 期 2, 页码 566-581出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2019.01.024
关键词
Queueing; Optimization; Approximate dynamic programming; Airport operations; Aviation
资金
- Engineering and Physical Sciences Research Council (EPSRC) [EP/M020258/1]
- EPSRC [EP/M020258/1] Funding Source: UKRI
Motivated by the need to develop time-efficient methods for minimizing operational delays at severely congested airports, we consider a problem involving the distribution of a common resource between two sources of time-varying demand. We formulate this as a dynamic program in which the objective is based on second moments of stochastic queue lengths and show that, for sufficiently high volumes of demand, optimal values can be well-approximated by quadratic functions of the system state. We identify conditions which enable the strong performance of myopic policies and develop approaches to the design of heuristic policies by means of approximate dynamic programming (ADP) methods. Numerical experiments suggest that our ADP-based heuristics, which require very little computational effort, are able to improve substantially upon the performances of more naive decision-making policies, particularly if exogenous system parameters vary considerably as functions of time. (C) 2019 The Authors. Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据