Loading...
Search for:
overbooking
0.062 seconds
Developing an Integrated Dynamic Revenue Management and Customer Relationship Management Model in Hotel Environment
, M.Sc. Thesis Sharif University of Technology ; Modarres, Mohammad (Supervisor)
Abstract
Revenue Management and Customer Relationship management are among the strategies that organizations use to increase their profitability. However, in the literature integrating these two strategies, have received little attention, especially in the case of Hotel. In this study, we develop a dynamic revenue management model to jointly make the capacity allocation and overbooking decision over a hotel network, in which customer relationship management strategies are also considered. Hotel customers are divided in two major groups of occasional and loyal customers. Price discounts and room availability is guaranteed for loyal customers, who are the hotel most profitable customers. A stochastic...
Developing an Efficient Solution Method Based on Dynamic Programming with Considering Nested and Cancelation in Revenue Management
, M.Sc. Thesis Sharif University of Technology ; Modarres, Mohammad (Supervisor)
Abstract
In this thesis by considering airplane capacity as a perishable asset revenue management models are employed for capacity allocation to customer different class. The thesis contains two main revenue management models. In the first one, single leg capacity allocation with overbooking, cancellation no-show and sell up is studied. The main contribution of this model is considering sell up or nested associated with other assumption. This problem is formulated as a dynamic programming model. Optimal policy and optimal seat allocation in case of overbooking is also determined. Contrary to what is assumed, it is shown that the income of lower fare class is more than accepting higher class.In this...
A Dynamic Programming Model to Address Airline Revenue Management
, M.Sc. Thesis Sharif University of Technology ; Modarres Yazdi, Mohammad (Supervisor)
Abstract
In this thesis, we address the Revenue Management problem, when there is cancellation, no-shows, overbooking, and refund constraints. We model this problem using Dynamic Programming. Given the fact that this problem is intractable, we develop a linear programming model that is equivalent to our problem. We first prove that the optimal value of linear programming objective function serves as an upper bound for the Dynamic Program. In the next part we develop a bid-pricing technique, using the shadow prices of the aforementioned linear program, to decide upon rejecting, or accepting the seats, in the network. Using the Monte-Carlo Simulation we show that there is a small distance between the...