A non-parametric approach to demand forecasting in revenue management. (English) Zbl 1349.90048
Summary: In revenue management, the profitability of the inventory and pricing decisions rests on the accuracy of demand forecasts. However, whenever a product is no longer available, true demand may differ from registered bookings, thus inducing a negative bias in the estimation figures, as well as an artificial increase in demand for substitute products. In order to address these issues, we propose an original Mixed Integer Nonlinear Program (MINLP) to estimate product utilities as well as capturing seasonal effects. This behavioral model solely rests on daily registered bookings and product availabilities. Its outputs are the product utilities and daily potential demands, together with the expected demand of each product within any given time interval. Those are obtained via a tailored algorithm that outperforms two well-known generic software for global optimization.
MSC:
| 90B05 | Inventory, storage, reservoirs |
| 90C11 | Mixed integer programming |
| 90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |
| 90C59 | Approximation methods and heuristics in mathematical programming |
| 91B42 | Consumer behavior, demand theory |
References:
| [1] | Andersson, S., Passenger choice analysis for seat capacity controla pilot project in Scandinavian Airlines, Int Trans Oper Res, 5, 471-486 (1998) |
| [2] | Azadeh, SS; Hosseinalifam, M.; Savard, G., The impact of customer behavior models on revenue management systems, Comput Manag Sci, 1-11 (2014) |
| [4] | Belotti, P.; Lee, J.; Liberti, L.; Margot, F.; Wächter, A., Branching and bounds tightening techniques for non-convex MINLP, Optim Methods Softw, 24, 597-634 (2009) · Zbl 1179.90237 |
| [5] | Costa, A.; Liberti, L., Relaxations of multilinear convex envelopes: dual is better than primal, (Experimental Algorithms (2012), Springer: Springer Berlin, Heidelberg), 87-98 |
| [6] | Cover, T.; Hart, P., Nearest neighbor pattern classification, IEEE Trans Inf Theory, 13, 21-27 (1967) · Zbl 0154.44505 |
| [7] | Cross, RG, Revenue management: hard-core tactics for market domination (1997), Universities Press: Universities Press New York, Broadway |
| [8] | Dudani, SA, The distance-weighted k-nearest-neighbor rule, IEEE Trans Syst Man Cybern, 325-327 (1976) |
| [9] | Escudero, LF; Monge, JF; Morales, DR; Wang, J., Expected future value decomposition based bid price generation for large-scale network revenue management, Transp Sci, 47, 181-197 (2013) |
| [10] | Haensel, A.; Koole, G., Estimating unconstrained demand rate functions using customer choice sets, J Revenue Pricing Manag, 10, 438-454 (2010) |
| [13] | Kunnumkal, S.; Topaloglu, H., A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior, Prod Oper Manag, 19, 575-590 (2010) |
| [14] | Lee, A., Airline reservations forecasting: probabilistic and statistical models of the booking process. Technical report, Cambridge, MA (1990), Flight Transportation Laboratory, Departmen of Aeronautics and Astronautics, Massachusetts Institute of Technology |
| [15] | Littlewood, K., Special issue papersforecasting and control of passenger bookings, J Revenue Pricing Manag, 4, 111-123 (2005) |
| [16] | Liu, Q.; van Ryzin, G., On the choice-based linear programming model for network revenue management, Manuf Serv Oper Manag, 10, 288-310 (2008) |
| [17] | McCormick, G., Computability of global solutions to factorable nonconvex programs convex underestimating problems, Math Program, 10, 147-175 (1976) · Zbl 0349.90100 |
| [18] | Möller, A.; Römisch, W.; Weber, K., Airline network revenue management by multistage stochastic programming, Comput Manag Sci, 5, 355-377 (2008) · Zbl 1178.90259 |
| [20] | Pölt, S., From bookings to demand: the process of unconstraining (2000), AGIFORS Reservations and Yield Management Study Group: AGIFORS Reservations and Yield Management Study Group New York |
| [21] | Queenan, C.; Ferguson, M.; Higbie, J.; Kapoor, R., A comparison of unconstraining methods to improve revenue management systems, Prod Oper Manag, 16, 729-746 (2009) |
| [22] | Ratliff, R.; Rao, B.; Narayan, C.; Yellepeddi, K., A multi-flight recapture heuristic for estimating unconstrained demand from airline bookings, J Revenue Pricing Manag, 7, 153-171 (2008) |
| [23] | van Ryzin, G., Future of revenue managementmodels of demand, J Revenue Pricing Manag, 4, 204-210 (2005) |
| [24] | Sa, J., Reservations forecasting in airline yield management. Technical Report (1987), Flight Transportation Laboratory, Massachusetts Institute of Technology: Flight Transportation Laboratory, Massachusetts Institute of Technology Cambridge, MA |
| [25] | Stefanescu, C., Multivariate customer demand: modeling and estimation from censored sales. Technical Report (2009), London Business School: London Business School Berlin, Germany |
| [26] | Talluri, K.; van Ryzin, G., Revenue management under a general discrete choice model of consumer behavior, Manag Sci, 50, 15-33 (2004) · Zbl 1168.91427 |
| [27] | Vulcano, G.; van Ryzin, G.; Chaar, W., OM practice-choice-based revenue managementan empirical study of estimation and optimization, Manuf Serv Oper Manag, 12, 371-392 (2010) |
| [28] | Vulcano, G.; Van Ryzin, G.; Ratliff, R., Estimating primary demand for substitutable products from sales transaction data, Oper Res, 60, 313-334 (2012) · Zbl 1248.91052 |
| [30] | Weatherford, L.; Belobaba, P., Revenue impacts of fare input and demand forecast accuracy in airline yield management, J Oper Res Soc, 52, 811-821 (2002) · Zbl 1130.90350 |
| [31] | Zeni, R., Improved forecast accuracy in airline revenue management by unconstraining demand estimates from censored data [Ph.D. thesis] (2001), MITl: MITl New Jersey |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
