Airline yield management : a dynamic seat allocation model
Suppose an airplane has a seat capacity of C, we have time T left before the airplane will take off, the fare structure is given, and the arrival process of booking requests is stochastic, we want to know if there is an optimal policy to control booking process in order to maximize total expected...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2008
|
| Online Access: | http://hdl.handle.net/2429/3109 |
| id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-3109 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-31092018-01-05T17:31:16Z Airline yield management : a dynamic seat allocation model Sun, Xiao Suppose an airplane has a seat capacity of C, we have time T left before the airplane will take off, the fare structure is given, and the arrival process of booking requests is stochastic, we want to know if there is an optimal policy to control booking process in order to maximize total expected revenue from this particular airplane. We formulate the problem as a continuous time Markov decision problem. Under certain conditions the existence and some of the properties of an optimal policy are shown. In the case where the arrival process is a nonhomogenous Poisson it is shown that the optimal policy has a very simple structure and that an e-optimal policy can be easily computed. It is also shown that in general 'Littlewood-type' formula, even being used continuously overtime, does not protect enough seats for full fare passengers and results in less total revenue. Business, Sauder School of Graduate 2008-12-18T19:32:28Z 2008-12-18T19:32:28Z 1992 1992-11 Text Thesis/Dissertation http://hdl.handle.net/2429/3109 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. 991540 bytes application/pdf |
| collection |
NDLTD |
| language |
English |
| format |
Others
|
| sources |
NDLTD |
| description |
Suppose an airplane has a seat capacity of C, we have time T left before the airplane
will take off, the fare structure is given, and the arrival process of booking requests is
stochastic, we want to know if there is an optimal policy to control booking process in
order to maximize total expected revenue from this particular airplane. We formulate
the problem as a continuous time Markov decision problem. Under certain conditions the
existence and some of the properties of an optimal policy are shown. In the case where
the arrival process is a nonhomogenous Poisson it is shown that the optimal policy has
a very simple structure and that an e-optimal policy can be easily computed. It is also
shown that in general 'Littlewood-type' formula, even being used continuously overtime,
does not protect enough seats for full fare passengers and results in less total revenue. === Business, Sauder School of === Graduate |
| author |
Sun, Xiao |
| spellingShingle |
Sun, Xiao Airline yield management : a dynamic seat allocation model |
| author_facet |
Sun, Xiao |
| author_sort |
Sun, Xiao |
| title |
Airline yield management : a dynamic seat allocation model |
| title_short |
Airline yield management : a dynamic seat allocation model |
| title_full |
Airline yield management : a dynamic seat allocation model |
| title_fullStr |
Airline yield management : a dynamic seat allocation model |
| title_full_unstemmed |
Airline yield management : a dynamic seat allocation model |
| title_sort |
airline yield management : a dynamic seat allocation model |
| publishDate |
2008 |
| url |
http://hdl.handle.net/2429/3109 |
| work_keys_str_mv |
AT sunxiao airlineyieldmanagementadynamicseatallocationmodel |
| _version_ |
1718586381996916736 |