A Model for Dynamic Airline Seat Inventory Control with Multiple Seat Bookings

TLDR

Airlines sell identical seats at different prices across booking classes to boost revenue, making it crucial to decide whether to accept or deny booking requests during the booking period. The study develops a discrete‑time dynamic programming model that yields an optimal booking policy reducible to critical values and examines its basic properties. The model imposes no assumptions on booking‑class arrival patterns and explicitly handles multiple seat bookings. Numerical examples illustrate the model and its computational efficiency is discussed.

Abstract

It is common for the airlines to sell a pool of identical seats at different prices according to different booking classes to improve revenues in a very competitive market. Under this practice, a complex yet very crucial problem is to determine whether a booking request for seats in a certain booking class occurring at some point in time during the booking period should be accepted or denied. This paper develops a discrete-time dynamic programming model for finding an optimal booking policy, which can be reduced to a set of critical values. Unlike many existing models, this model does not require any assumptions about the arrival pattern for the various booking classes. Furthermore, multiple seat bookings, which are a practical issue in airline seat inventory control, are also incorporated into the model. In this paper, the basic properties of the model are studied. Numerical examples are presented. Computational issues, including the computational efficiency of the model, are also discussed.