The DOI matches its Crossref record.
An Airline Seat Management Model for a Single Leg Route When Lower Fare Classes Book First
Abstract
It is common practice for airlines to charge several different fares for a common pool of seats. This paper presents a model that has been used to address the problem of when to refuse booking requests for a given fare level to save the seat for a potential request at a higher fare level. This model assumes that lower fare passengers book before higher fare passengers book. This occurs quite frequently in practice, where lower fare passengers are usually vacationers and higher fare passengers are usually business travelers. In fact, many airlines mandate this practice by imposing advance booking requirements on lower fare classes to prevent business travelers from using them. We present an algorithm that finds a seat management policy that maximizes mean revenue by establishing a critical value for each fare class. Booking requests for a particular fare level are accepted if the number of empty seats is strictly greater than its critical value and rejected otherwise. This critical value is a decreasing function of the fare price and is equal to zero for the class with the highest fare.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
Gallego, G., & van Ryzin, G. (1994) · Management Science · doi:10.1287/mnsc.40.8.999 · Cited by 1,557
Revenue Management: Research Overview and Prospects
McGill, J. I., & van Ryzin, G. J. (1999) · Transportation Science · doi:10.1287/trsc.33.2.233 · Cited by 1,131
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Talluri, K., & van Ryzin, G. (2004) · Management Science · doi:10.1287/mnsc.1030.0147 · Cited by 1,108
A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
Gallego, G., & van Ryzin, G. (1997) · Operations Research · doi:10.1287/opre.45.1.24 · Cited by 634
An Analysis of Bid-Price Controls for Network Revenue Management
Talluri, K., & van Ryzin, G. (1998) · Management Science · doi:10.1287/mnsc.44.11.1577 · Cited by 412
A Model for Dynamic Airline Seat Inventory Control with Multiple Seat Bookings
Lee, T. C., & Hersh, M. (1993) · Transportation Science · doi:10.1287/trsc.27.3.252 · Cited by 344
Airline Yield Management with Overbooking, Cancellations, and No-Shows
Subramanian, J., Stidham, S., & Lautenbacher, C. J. (1999) · Transportation Science · doi:10.1287/trsc.33.2.147 · Cited by 338
Airline Seat Allocation with Multiple Nested Fare Classes
Brumelle, S. L., & McGill, J. I. (1993) · Operations Research · doi:10.1287/opre.41.1.127 · Cited by 332
Optimal Starting Times for End-of-Season Sales and Optimal Stopping Times for Promotional Fares
Feng, Y., & Gallego, G. (1995) · Management Science · doi:10.1287/mnsc.41.8.1371 · Cited by 314
Applications of operations research in the air transport industry
Barnhart, C., Belobaba, P., & Odoni, A. R. (2003) · Transportation Science · doi:10.1287/trsc.37.4.368.23276 · Cited by 309
“Optimal formulations of the multiple nested class problem have also been published by Curry (1990), Brumelle et al. (1990), and Wollmer (1992).”
BackgroundAn overview of revenue management and dynamic pricing models in hotel business
Bandalouski, A. M., Kovalyov, M. Y., Pesch, E., & Tarim, S. A. (2018) · RAIRO - Operations Research · doi:10.1051/ro/2018001 · Cited by 25
Metadata
- Authors
- Wollmer, R. D.
- Venue
- Operations Research
- Published
- 1992-02
- Volume
- 40
- Issue
- 1
- Pages
- 26-37
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1995726541
- Cited by
- 221
- References
- 0
- FWCI
- 4.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.