Multiperiod Airline Overbooking with a Single Fare Class

Authors:
Suman Basuroy;Dung Nguyen;Richard E. Chatwin
Affiliations:
-;-;-
Venue:
Operations Research
Year:
1998

Citing 0
Cited 4

A Reinforcement Learning Algorithm Based on Policy Iteration for Average Reward: Empirical Results with Yield Management and Convergence Analysis

Machine Learning
A stochastic approach to hotel revenue optimization

Computers and Operations Research
A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network

INFORMS Journal on Computing
Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a multiperiod airline overbooking problem that relates to a single-leg flight and a single service class. Passengers may cancel their reservations at any time, including being no-shows at flight-time. At that time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. We give conditions on the fares, refunds, and distributions of passenger demand for reservations and cancellations in each period, and on the bumping penalty function, that ensure that a booking-limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations is less than that booking limit, and declines reservation requests otherwise. The optimal booking limits are easily computed. We give conditions under which the optimal booking limits are monotone in the time to flight departure. The model is applied to the discount allocation problem in which lower fare classes book prior to higher fare classes.