302 The UMAP Journal 23.3 (2002)
Beckman [1958] models booking and no-shows in an effort to find an optimal
overbooking strategy. He ignores advance cancellations, assuming that all can-
cellations are no-shows [Rothstein 1985]. A method that is easy to implement
but sophisticated enough to allow for cancellations and group reservations was
developed by Taylor [1962]. Versions of this model were implemented at Iberia
Airlines [Shlifer and Vardi 1975], British Overseas Airways Corporation, and
El Al Airlines [Rothstein 1985].
None of these approaches considers multiple fare classes. Littlewood [1972]
offers a simple two-fare allocation rule: A discount fare should be sold only if
the discount fare is greater than or equal to the expected marginal return from
selling the seat at full-fare. This idea was generalized by Belobaba [1989] to in-
clude any number of fare classes and allow the integration of overbooking. We
use expected marginal seat revenue in predicting about overbooking schemes.
There is a multitude of work on the subject [McGill 1999]—according to
Weatherford and Bodily [1992], there are more than 124,416 classes of models
for variations of the yield management problem, though research has settled
into just a few of these. Several authors tried to better Belobaba’s [1987] heuristic
in the presence of three or more fare classes (for which it is demonstrably sub-
optimal) [Weatherford and Bodily 1992]; generally, these adaptive methods for
obtaining optimal booking limits for single-leg flights are done by dynamic
programming [Mcgill 1999].
After deregulation in 1978, airlines were no longer required to maintain a
direct-route system to major cities. Many shifted to a hub-and-spoke system,
and network effects began to grow more important. To maximize revenue, an
airline may want to consider a passenger’s full itinerary before accepting or
denying their ticket request for a particular leg. For example, an airline might
prefer to book a discount fare rather than one at full price if the passenger is
continuing on to another destination (and thus paying an additional fare).
The first implementations of the origin-destination control problem consid-
ered segments of flights. The advantage to this was that a segment could be
blacked out to a particular fare class, lowering the overall complexity of a book-
ing scheme. Another method, virtual nesting, combines fare classes and flight
schedules into distinct buckets [Mcgill 1999]. Inventory control on these buck-
ets would then give revenue-increasing results. Finally, the bid-price method
deterministically assigns a value to different seats on a flight leg. The legs in
an itinerary are then summed to establish a bid-price for that itinerary; a ticket
request is accepted only if the fare exceeds the bid-price [Mcgill 1999]
The most realistic yield management problem takes into account five price
classes. The ticket demands for different fare classes are randomized and corre-
lated with one other to allow for sell-ups and the recapture of rejected customers
on later flights. Passengers can no-show or cancel at any time. Group reser-
vations are treated separately from individuals—their cancellation probability
distribution is likely different. Currently, most work assumes that passengers
who pay full fare would not first check for availability of a lower-class ticket;
a more realistic model would allow buyers of a higher-class ticket to be di-