Research output: Contribution to conference - Without ISBN/ISSN › Abstract
Research output: Contribution to conference - Without ISBN/ISSN › Abstract
}
TY - CONF
T1 - A Slot Allocation Model with Queuing Constraints based on the Server-Always-Busy Approximation
AU - Fairbrother, Jamie
AU - Shone, Robert
AU - Zografos, Konstantinos
AU - Glazebrook, Kevin David
N1 - Presentation at OR60 conference, 2018.
PY - 2018/9
Y1 - 2018/9
N2 - At congested airports outside the US, airlines must obtain slots in order to land and take-off. Slots must be allocated to airlines in a way which matches their requested times as far as possible, while satisfying operational constraints. A key issue in the allocation of slots is how to construct a schedule which avoids long queuing delays. This can be addressed implicitly through the use of capacity constraints which limit the number of runway movements which can take place during a given length of time, or explicitly through the incorporation of queuing dynamics into the slot allocation model. In this work we present an approximation to queuing dynamics based on the assumption that the queue is never empty. We demonstrate how this can be used to formulate tractable mixed integer non-linear programs which could be used to set capacity limits, or could be incorporated directly into a slot allocation model.
AB - At congested airports outside the US, airlines must obtain slots in order to land and take-off. Slots must be allocated to airlines in a way which matches their requested times as far as possible, while satisfying operational constraints. A key issue in the allocation of slots is how to construct a schedule which avoids long queuing delays. This can be addressed implicitly through the use of capacity constraints which limit the number of runway movements which can take place during a given length of time, or explicitly through the incorporation of queuing dynamics into the slot allocation model. In this work we present an approximation to queuing dynamics based on the assumption that the queue is never empty. We demonstrate how this can be used to formulate tractable mixed integer non-linear programs which could be used to set capacity limits, or could be incorporated directly into a slot allocation model.
M3 - Abstract
T2 - 60th Annual Conference of the Operational Research Society
Y2 - 11 September 2018 through 13 September 2018
ER -