Solving the hierarchical data selection problem arising in airline revenue management systems

J. Xu, A. Lim and M. Sohoni

International Journal of Revenue Management, 2008, vol. 2, issue 1, 63-77

Abstract: In this paper, we describe an important optimisation problem arising in airline revenue management systems. The problem is to select the maximum number of average fare data while keeping the selected data in a non increasing hierarchical order. We first formulate the problem mathematically using 0–1 binary integer programming, and then further derive a stronger formulation using clique cuts. Moreover, an extension of the problem is studied where the relative importance of each data point can be derived from passenger count information. We develop an efficient dynamic programming-based algorithm to solve the problem optimally. The preliminary computational results using real airline data show that our approach can solve the problem efficiently and save significantly much information that are previously discarded.

Keywords: data selection; dynamic programming; longest increasing subsequence; optimisation; airline revenue management; average fare data; airline fares. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=18178 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijrevm:v:2:y:2008:i:1:p:63-77

Access Statistics for this article

More articles in International Journal of Revenue Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().