Computing Bid Prices for Revenue Management Under Customer Choice Behavior

Authors:
Juan M. Chaneton;Gustavo Vulcano
Affiliations:
Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, 1428 Buenos Aires, Argentina;Department of Information, Operations and Management Sciences, Leonard N. Stern School of Business, New York University, New York, New York 10012
Venue:
Manufacturing & Service Operations Management
Year:
2011

Citing 12
Cited 2

An Analysis of Bid-Price Controls for Network Revenue Management

Management Science
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Stocking Retail Assortments Under Dynamic Consumer Substitution

Operations Research
Revenue Management Under a General Discrete Choice Model of Consumer Behavior

Management Science
On the Choice-Based Linear Programming Model for Network Revenue Management

Manufacturing & Service Operations Management
Computing Virtual Nesting Controls for Network Revenue Management Under Customer Choice Behavior

Manufacturing & Service Operations Management
Dynamic Bid Prices in Revenue Management

Operations Research
Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management

Operations Research
Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management

Operations Research
A Column Generation Algorithm for Choice-Based Network Revenue Management

Operations Research
An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice

Transportation Science
Estimating Primary Demand for Substitutable Products from Sales Transaction Data

Operations Research

A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice

Mathematics of Operations Research
Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a choice-based, network revenue management (RM) problem in a setting where heterogeneous customers consider an assortment of products offered by a firm (e.g., different flight times, fare classes, and/or routes). Individual choice decisions are modeled through an ordered list of preferences, and minimal assumptions are made about the statistical properties of this demand sequence. The firm manages the availability of products using a bid-price control strategy, and would like to optimize the control parameters. We formulate a continuous demand and capacity model for this problem that allows for the partial acceptance of requests. The model admits a simple calculation of the sample path gradient of the revenue function. This gradient is then used to construct a stochastic steepest ascent algorithm. We show that the algorithm converges (w.p.1) to a stationary point of the expected revenue function under mild conditions. The procedure is relatively efficient from a computational standpoint, and in our synthetic and real-data experiments performs comparably to or even better than other choice-based methods that are incompatible with the current infrastructure of RM systems. These features make it an interesting candidate to be pursued for real-world applications.