184 research outputs found
Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information
Motivated by several practical applications, we consider assortment
optimization over a continuous spectrum of products represented by the unit
interval, where the seller's problem consists of determining the optimal subset
of products to offer to potential customers. To describe the relation between
assortment and customer choice, we propose a probabilistic choice model that
forms the continuous counterpart of the widely studied discrete multinomial
logit model. We consider the seller's problem under incomplete information,
propose a stochastic-approximation type of policy, and show that its regret --
its performance loss compared to the optimal policy -- is only logarithmic in
the time horizon. We complement this result by showing a matching lower bound
on the regret of any policy, implying that our policy is asymptotically
optimal. We then show that adding a capacity constraint significantly changes
the structure of the problem, by constructing an instance in which the regret
of any policy after time periods is bounded below by a positive constant
times . We propose a policy based on kernel-density estimation
techniques, and show that its regret is bounded above by a constant times
. Numerical illustrations show that our policies outperform or are on
par with alternatives based on discretizing the product space
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
- …