Pricing substitutable flights in airline revenue management

Research output: Contribution to journalArticlepeer-review

71 Scopus citations

Abstract

We develop a Markov decision process formulation of a dynamic pricing problem for multiple substitutable flights between the same origin and destination, taking into account customer choice among the flights. The model is rendered computationally intractable for exact solution by its multi-dimensional state and action spaces, so we develop and analyze various bounds and heuristics. We first describe three related models, each based on some form of pooling, and introduce heuristics suggested by these models. We also develop separable bounds for the value function which are used to construct value- and policy-approximation heuristics. Extensive numerical experiments show the value- and policy-approximation approaches to work well across a wide range of problem parameters, and to outperform the pooling-based heuristics in most cases. The methods are applicable even for large problems, and are potentially useful for practical applications.

Original languageEnglish (US)
Pages (from-to)848-861
Number of pages14
JournalEuropean Journal of Operational Research
Volume197
Issue number3
DOIs
StatePublished - Sep 16 2009

Bibliographical note

Funding Information:
This material is based upon work supported by the National Science Foundation under Grant Number DMI-0115385.

Keywords

  • Customer choice
  • Markov decision processes
  • Pricing
  • Yield management

Fingerprint

Dive into the research topics of 'Pricing substitutable flights in airline revenue management'. Together they form a unique fingerprint.

Cite this