z-logo
Premium
Multi‐period airline overbooking with multiple fare classes
Author(s) -
Chatwin Richard E.
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199608)43:5<603::aid-nav1>3.0.co;2-9
Subject(s) - reservation , class (philosophy) , limit (mathematics) , time limit , computer science , operations research , dynamic programming , operations management , mathematics , economics , computer network , artificial intelligence , mathematical analysis , management , algorithm
Consider a multi‐period multi‐fare class airline overbooking problem that relates to a single‐leg flight. Passengers may cancel their reservations at any time, including being no ‐ shows at flight‐time. Canceling passengers receive a refund that depends on their fare class, e.g., supersaver, coach, etc. At flight‐time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. A continuous state‐space dynamic programming model is developed in which the state is the numbers of reservations currently on hand in each fare class. In each period, reservation requests occur in only one fare class and the fraction of reservations canceling in each class is independent of the number of reservations therein. A booking ‐ limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations in the fare class is less than the booking limit, and declines reservation requests otherwise. The booking limits for each class depend on the numbers of reservations in the other classes. When there are two fare classes the optimal booking limits in each class decrease with the number of reservations in the other class. © 1996 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here