Itinerary-based nesting control with upsell

Chan Seng Pun, Diego Klabjan*, Fikri Karaesmen, Sergey Shebalov

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

In order to accept future high-yield booking requests, airlines protect seats from low-yield passengers. More seats may be reserved when passengers faced with closed fare classes can upsell to open higher fare classes. We address the airline revenue management problem with capacity nesting and customer upsell, and formulate this problem by a stochastic optimization model to determine a set of static protection levels for each itinerary. We apply an approximate dynamic programming framework to approximate the objective function by piecewise linear functions, whose slopes (marginal revenue) are iteratively updated and returned by an efficient heuristic that simultaneous handles both nesting and upsells. The resulting allocation policy is tested over a real airline network and benchmarked against the randomized linear programming bid-price policy under various demand settings. Simulation results suggest that the proposed allocation policy significantly outperforms when incremental demand or upsell probability are high. Structural analyses are also provided for special demand dependence cases.

Original languageEnglish (US)
Pages (from-to)107-137
Number of pages31
JournalJournal of Revenue and Pricing Management
Volume15
Issue number2
DOIs
StatePublished - Apr 1 2016

Keywords

  • approximate dynamic programming
  • capacity nesting
  • customer upsell
  • network revenue management

ASJC Scopus subject areas

  • Business and International Management
  • Finance
  • Economics and Econometrics
  • Strategy and Management

Fingerprint Dive into the research topics of 'Itinerary-based nesting control with upsell'. Together they form a unique fingerprint.

Cite this