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

Xu, J and Lim, A and Sohoni, M G (2008) Solving the hierarchical data selection problem arising in airline revenue management systems. International Journal of Revenue Management, 2 (1).

Full text not available from this repository. (Request a copy)

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.

Affiliation: Indian School of Business
ISB Creators:
ISB CreatorsORCiD
Sohoni, M Ghttp://orcid.org/0000-0003-0510-7109
Item Type: Article
Uncontrolled Keywords: data selection, dynamic programming, longest increasing subsequence, optimisation, airline revenue management, average fare data, airline fares
Subjects: Operations Management
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 11:13
Last Modified: 03 Apr 2019 11:13
URI: http://eprints.exchange.isb.edu/id/eprint/743
Publisher URL: https://doi.org/10.1504/IJRM.2008.018178
Publisher OA policy: http://sherpa.mimas.ac.uk/romeo/issn/1474-7332/
Related URLs:

Actions (login required)

View Item View Item
Statistics for DESI ePrint 743 Statistics for this ePrint Item