On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies

In this paper we propose a static policy for the optimal allocation of a fixed number of exclusive-use check-in counters dedicated to a single flight. We first provide the motivation for considering the static policy by showing that the dynamic policy already available in the literature suffers from...

Full description

Saved in:
Bibliographic Details
Main Authors: PARLAR, Mahmut, RODRIGUES, Brian, MOOSA, Sharafali
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/3318
https://ink.library.smu.edu.sg/context/lkcsb_research/article/4317/viewcontent/s12597_012_0110_5.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-4317
record_format dspace
spelling sg-smu-ink.lkcsb_research-43172024-04-04T06:28:37Z On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies PARLAR, Mahmut RODRIGUES, Brian MOOSA, Sharafali In this paper we propose a static policy for the optimal allocation of a fixed number of exclusive-use check-in counters dedicated to a single flight. We first provide the motivation for considering the static policy by showing that the dynamic policy already available in the literature suffers from the curse of dimensionality. The objective is to minimize the (expected) total cost of waiting, counter operation, and passenger delay costs which we show to be convex in the number of counters allocated. In those cases where the passenger delay cost is difficult to estimate, we propose an alternative formulation and minimize the operating and waiting costs subject to a probabilistic service-level constraint. This constraint ensures that the probability of all passengers being cleared by the gate closing time exceeds a specific level. Finally, we provide a simple procedure for estimating the implied delay costs by exploiting the properties of the two optimization problems. Compared to the difficult-to-evaluate dynamic policy in other papers in the literature, the present static policy requires only a few function evaluations. This feature of the static policy makes it easy to find the optimal number of counters even when the number of booked passengers is in the hundreds. 2013-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/3318 info:doi/10.1007/s12597-012-0110-5 https://ink.library.smu.edu.sg/context/lkcsb_research/article/4317/viewcontent/s12597_012_0110_5.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Transportation Queues Airline check-in counters Static policy Stochastic models Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Transportation
Queues
Airline check-in counters
Static policy
Stochastic models
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Transportation
Queues
Airline check-in counters
Static policy
Stochastic models
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
PARLAR, Mahmut
RODRIGUES, Brian
MOOSA, Sharafali
On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
description In this paper we propose a static policy for the optimal allocation of a fixed number of exclusive-use check-in counters dedicated to a single flight. We first provide the motivation for considering the static policy by showing that the dynamic policy already available in the literature suffers from the curse of dimensionality. The objective is to minimize the (expected) total cost of waiting, counter operation, and passenger delay costs which we show to be convex in the number of counters allocated. In those cases where the passenger delay cost is difficult to estimate, we propose an alternative formulation and minimize the operating and waiting costs subject to a probabilistic service-level constraint. This constraint ensures that the probability of all passengers being cleared by the gate closing time exceeds a specific level. Finally, we provide a simple procedure for estimating the implied delay costs by exploiting the properties of the two optimization problems. Compared to the difficult-to-evaluate dynamic policy in other papers in the literature, the present static policy requires only a few function evaluations. This feature of the static policy makes it easy to find the optimal number of counters even when the number of booked passengers is in the hundreds.
format text
author PARLAR, Mahmut
RODRIGUES, Brian
MOOSA, Sharafali
author_facet PARLAR, Mahmut
RODRIGUES, Brian
MOOSA, Sharafali
author_sort PARLAR, Mahmut
title On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
title_short On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
title_full On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
title_fullStr On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
title_full_unstemmed On the Allocation of Exclusive-use Counters for Airport Check-in Queues: Static vs. Dynamic Policies
title_sort on the allocation of exclusive-use counters for airport check-in queues: static vs. dynamic policies
publisher Institutional Knowledge at Singapore Management University
publishDate 2013
url https://ink.library.smu.edu.sg/lkcsb_research/3318
https://ink.library.smu.edu.sg/context/lkcsb_research/article/4317/viewcontent/s12597_012_0110_5.pdf
_version_ 1814047465210380288