Computing Time-Dependent Bid Prices in Network Revenue Management Problems

Sumit Kunnumkal () and Huseyin Topaloglu ()
Additional contact information
Sumit Kunnumkal: Indian School of Business, Gachibowli, Hyderabad 500032, India
Huseyin Topaloglu: School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853

Transportation Science, 2010, vol. 44, issue 1, 38-62

Abstract: We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend on how much time is left until departure. We show that our method provides an upper bound on the optimal total expected revenue and that this upper bound is tighter than the one provided by the widely known deterministic linear programming approach. Furthermore, it is possible to use the bid prices computed by our method as a starting point in a dynamic programming decomposition-like idea to decompose the network revenue management problem by the flight legs and to obtain dynamic and capacity-dependent bid prices. Our computational experiments indicate that the proposed method improves on many standard benchmarks.

Keywords: network revenue management; approximate dynamic programming; Lagrangian relaxation (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1090.0291 (application/pdf)

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:inm:ortrsc:v:44:y:2010:i:1:p:38-62

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().