Discrete dynamic pricing and application of network revenue management for FlixBus

We consider a real discrete pricing problem in network revenue management for FlixBus. We improve the company's current pricing policy by an intermediate optimization step using booking limits from standard deterministic linear programs. We pay special attention to computational efficiency. FlixBus' strategic decision to allow for low-cost refunds might encourage large group bookings early in the booking process. In this context, we discuss counter-intuitive findings comparing booking limits with static bid price policies. We investigate the theoretical question whether the standard deterministic linear program for network revenue management does provide an upper bound on the optimal expected revenue if customer's willingness to pay varies over time

A review of choice-based revenue management : theory and methods

Over the last fifteen years, the theory and practice of revenue management has experienced significant developments due to the need to incorporate customer choice behavior. In this paper, we portray these developments by reviewing the key literature on choice-based revenue management, specifically focusing on methodological publications of availability control over the years 2004–2017. For this purpose, we first state the choice-based network revenue management problem by formulating the underlying dynamic program, and structure the review according to its components and the resulting inherent challenges. In particular, we first focus on the demand modeling by giving an overview of popular choice models, discussing their properties, and describing estimation procedures relevant to choice-based revenue management. Second, we elaborate on assortment optimization, which is a fundamental component of the problem. Third, we describe recent developments on tackling the entire control problem. We also discuss the relation to dynamic pricing. Finally, we give directions for future research

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135128/1/nav21704.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/135128/2/nav21704_am.pd

Dynamic pricing under customer choice behavior for revenue management in passenger railway networks

Revenue management (RM) for passenger railway is a small but active research field with an increasing attention during the past years. However, a detailed look into existing research shows that most of the current models in theory rely on traditional RM techniques and that advanced models are rare. This thesis aims to close the gap by proposing a state-of-the-art passenger railway pricing model that covers the most important properties from practice, with a special focus on the German railway network and long-distance rail company Deutsche Bahn Fernverkehr (DB). The new model has multiple advantages over DB’s current RM system. Particularly, it uses a choice-based demand function rather than a traditional independent demand model, is formulated as a network model instead of the current leg-based approach and finally optimizes prices on a continuous level instead of controlling booking classes. Since each itinerary in the network is considered by multiple heterogeneous customer segments (e.g., differentiated by travel purpose, desired departure time) a discrete mixed multinomial logit model (MMNL) is applied to represent demand. Compared to alternative choice models such as the multinomial logit model (MNL) or the nested logit model (NL), the MMNL is significantly less considered in pricing research. Furthermore, since the resulting deterministic multi-product multi-resource dynamic pricing model under the MMNL turns out to be non- linear non-convex, an open question is still how to obtain a globally optimal solution. To narrow this gap, this thesis provides multiple approaches that make it able to derive a solution close to the global optimum. For medium-sized networks, a mixed-integer programming approach is proposed that determines an upper bound close to the global optimum of the original model (gap < 1.5%). For large-scale networks, a heuristic approach is presented that significantly decreases the solution time (by factor up to 56) and derives a good solution for an application in practice. Based on these findings, the model and heuristic are extended to fit further price constraints from railway practice and are tested in an extensive simulation study. The results show that the new pricing approach outperforms both benchmark RM policies (i.e., DB’s existing model and EMSR-b) with a revenue improvement of approx. +13-15% over DB’s existing approach under a realistic demand scenario. Finally, to prepare data for large-scale railway networks, an algorithm is presented that automatically derives a large proportion of necessary data to solve choice-based network RM models. This includes, e.g., the set of all meaningful itineraries (incl. transfers) and resources in a network, the corresponding resource consumption and product attribute values such as travel time or number of transfers. All taken together, the goal of this thesis is to give a broad picture about choice-based dynamic pricing for passenger railway networks