Massachusetts Institute of Technology
Airline revenue management methods for less restricted fare structures
Abstract
dc:description.abstractTraditional Revenue Management systems were developed to maximize airlines' revenues in restricted fare product environments, based on the assumption of independence of demand by fare class. With the rapid emergence of low-cost carriers in various parts of the world, the pricing environments have changed. The network carriers have had to deal with undifferentiated fare structures, for which demand for each fare class can no longer be assumed to be independent, given that customers systematically buy the lowest fare available in the absence of distinctions between fare products. In these fare structures, traditional Revenue Management systems lead to a "spiral down" of revenues. The first goal of this thesis is to present two alternatives that address the problem described above, allowing airlines to partially recover from the decrease in revenue which occurs when an airline removes the restrictions in its fare structure. These alternatives are designed for implementation into O&D-Control - or network Revenue Management - methods. The alternative methods are based on the sell-up probability, which is the probability that a passenger is willing to buy a higher-fare ticket in case his/her request is denied. One of the methods ("Q-Forecasting") modifies the forecaster by estimating the demand based on the probability of sell-up, while the other ("Fare Adjustment") acts at the booking limit optimizer level, accounting again for the sell-up potential.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2005
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Cléaz-Savoyen, Richard L
- Advisor dc:contributor.advisor
-
- Peter P. Belobaba.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/32439
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/32439