network revenue
Recently Published Documents


TOTAL DOCUMENTS

125
(FIVE YEARS 24)

H-INDEX

22
(FIVE YEARS 3)

Author(s):  
Christiane Barz ◽  
Simon Laumer ◽  
Marcel Freyschmidt ◽  
Jesús Martínez-Blanco

AbstractWe 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.


2021 ◽  
pp. 53-59
Author(s):  
Curt Cramer ◽  
Andreas Thams

2021 ◽  
Author(s):  
Ganesh Janakiraman ◽  
Milind Dawande ◽  
Chandrasekhar Manchiraju

2020 ◽  
Vol 286 (3) ◽  
pp. 1002-1017
Author(s):  
Thibault Barbier ◽  
Miguel F. Anjos ◽  
Fabien Cirinei ◽  
Gilles Savard

2020 ◽  
Vol 66 (7) ◽  
pp. 2993-3009 ◽  
Author(s):  
Pornpawee Bumpensanti ◽  
He Wang

We consider a canonical quantity-based network revenue management problem where a firm accepts or rejects incoming customer requests irrevocably in order to maximize expected revenue given limited resources. Because of the curse of dimensionality, the exact solution to this problem by dynamic programming is intractable when the number of resources is large. We study a family of re-solving heuristics that periodically re-optimize an approximation to the original problem known as the deterministic linear program (DLP), where random customer arrivals are replaced by their expectations. We find that, in general, frequently re-solving the DLP produces the same order of revenue loss as one would get without re-solving, which scales as the square root of the time horizon length and resource capacities. By re-solving the DLP at a few selected points in time and applying thresholds to the customer acceptance probabilities, we design a new re-solving heuristic with revenue loss that is uniformly bounded by a constant that is independent of the time horizon and resource capacities. This paper was accepted by Kalyan Talluri, revenue management and market analytics.


Sign in / Sign up

Export Citation Format

Share Document