A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
We consider a network revenue management problem with customer choice and exogenous prices. We study the performance of a class of certainty-equivalent heuristic control policies. These heuristics periodically re-solve the deterministic linear program (DLP) that results when all future random variables are replaced by their average values and implement the solutions in a probabilistic manner. We provide an upper bound for the expected revenue loss under such policies when compared to the optimal policy. Using this bound, we construct a schedule of re-solving times such that the resulting expected revenue loss, obtained by re-solving the DLP at these times and implementing the solution as a probabilistic scheme, is bounded by a constant that is independent of the size of the problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
The Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Williams, D. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813658 · Cited by 1,691
Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
Gallego, G., & van Ryzin, G. (1994) · Management Science · doi:10.1287/mnsc.40.8.999 · Cited by 1,557
(1992) · Choice Reviews Online · doi:10.5860/choice.30-1565 · Cited by 1,415
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Talluri, K., & van Ryzin, G. (2004) · Management Science · doi:10.1287/mnsc.1030.0147 · Cited by 1,108 · cited 1×
“We remark here that our model subsumes the choice model in Talluri and van Ryzin [14].”
ResultA Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
Gallego, G., & van Ryzin, G. (1997) · Operations Research · doi:10.1287/opre.45.1.24 · Cited by 634
An Analysis of Bid-Price Controls for Network Revenue Management
Talluri, K., & van Ryzin, G. (1998) · Management Science · doi:10.1287/mnsc.44.11.1577 · Cited by 412
On the Choice-Based Linear Programming Model for Network Revenue Management
Liu, Q., & van Ryzin, G. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0169 · Cited by 366 · cited 2×
“Despite this, it is known, in setting a bit more restrictive than ours, that when the size of the problem as represented by a number k becomes large, the expected revenue loss from using a DLP-based control, rather than DP, is no worse than O( √ k) (Liu and van Ryzin (2008), Cooper (2002)).”
BackgroundDynamic Pricing Strategies for Multiproduct Revenue Management Problems
Maglaras, C., & Meissner, J. (2006) · Manufacturing & Service Operations Management · doi:10.1287/msom.1060.0105 · Cited by 307 · cited 3×
“0 4! k2(1− t)2 dt ≤ e(2)4! k , and (11) ∫ 1”
BackgroundInfluentialDynamic Bid Prices in Revenue Management
Adelman, D. (2007) · Operations Research · doi:10.1287/opre.1060.0368 · Cited by 250 · cited 34×
“That is, we have: V kopt −E[RkPAC(0, 1)] ≤ E[RkMPAC(τkN , 1)]−E[RkPAC(τkN , 1)] ≤ ρ̂E [√ k(1− τkN ) ] for some constants ρ̂ independent of k.”
BackgroundInfluentialAn Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice
Zhang, D., & Adelman, D. (2009) · Transportation Science · doi:10.1287/trsc.1090.0262 · Cited by 226 · cited 2×
“…literature documents many attempts to find heuristic solutions that yield respectable performance and yet are computationally tractable (Adelman (2007), Zhang and Adelman (2009), Meissner and Strauss (2009), Chaneton and Vulcano (2009), Farias and Van Roy (2007), Kunnumkal and Topaloglu (2008)).”
BackgroundAsymptotic Behavior of an Allocation Policy for Revenue Management
Cooper, W. L. (2002) · Operations Research · doi:10.1287/opre.50.4.720.2855 · Cited by 168 · cited 2×
“(5) 4To be more precise, we should have written RPAC(Γ) to express the dependence of the value of RPAC on the choice of Γ.”
BackgroundNetwork revenue management with inventory-sensitive bid prices and customer choice
Meissner, J., & Strauss, A. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.06.033 · Cited by 120 · cited 2×
“…literature documents many attempts to find heuristic solutions that yield respectable performance and yet are computationally tractable (Adelman (2007), Zhang and Adelman (2009), Meissner and Strauss (2009), Chaneton and Vulcano (2009), Farias and Van Roy (2007), Kunnumkal and Topaloglu (2008)).”
BackgroundKunnumkal, S., & Topaloğlu, H. (2009) · Production and Operations Management · doi:10.1111/j.1937-5956.2009.01118.x · Cited by 91 · cited 1×
“…literature documents many attempts to find heuristic solutions that yield respectable performance and yet are computationally tractable (Adelman (2007), Zhang and Adelman (2009), Meissner and Strauss (2009), Chaneton and Vulcano (2009), Farias and Van Roy (2007), Kunnumkal and Topaloglu (2008)).”
BackgroundAn Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem
Reiman, M. I., & Wang, Q. (2008) · Mathematics of Operations Research · doi:10.1287/moor.1070.0288 · Cited by 91 · cited 5×
“• The following can be proved: E[1− τ 1 ] = O(k−1/2) (13) E[1− τ l ] = O ( r−1 l−1k −1/2 √ E[1− τk l−1] ) for all l = 2, .”
BackgroundMethodResultInfluentialRe-solving stochastic programming models for airline revenue management
Chen, L., & Homem‐de‐Mello, T. (2009) · Annals of Operations Research · doi:10.1007/s10479-009-0603-7 · Cited by 57 · cited 4×
“Chen and Homem-de-Mello (2006) studied the impact of re-solving a two-stage stochastic programming formulation and prove that re-solving can never worsen expected revenue in their setting.”
BackgroundInfluentialComputing Bid Prices for Revenue Management Under Customer Choice Behavior
Chaneton, J. M., & Vulcano, G. J. (2011) · Manufacturing & Service Operations Management · doi:10.1287/msom.1110.0338 · Cited by 53 · cited 1×
“…literature documents many attempts to find heuristic solutions that yield respectable performance and yet are computationally tractable (Adelman (2007), Zhang and Adelman (2009), Meissner and Strauss (2009), Chaneton and Vulcano (2009), Farias and Van Roy (2007), Kunnumkal and Topaloglu (2008)).”
BackgroundAn Analysis of the Control-Algorithm Re-solving Issue in Inventory and Revenue Management
Secomandi, N. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0184 · Cited by 50 · cited 2×
“1 (see Appendix C) when Γ is an empty set and (14) can be proved recursively, or by induction.”
Background
Cited by
Clearance Pricing Optimization for a Fast-Fashion Retailer
Caro, F., & Gallien, J. (2012) · Operations Research · doi:10.1287/opre.1120.1102 · Cited by 203
Clearance Pricing Optimization for a Fast-Fashion Retailer
Caro, F., & Gallien, J. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1731402 · Cited by 203
A review of choice-based revenue management: Theory and methods
Strauss, A. K., Klein, R., & Steinhardt, C. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.01.011 · Cited by 171
“Jasin and Kumar (2012) investigate such re-solving schedules for a deterministic linear programming formulation under customer choice and give performance guarantees in the form of a bound on expected revenue loss relative to the optimal expected revenue.”
Background
Metadata
- Authors
- Jasin, S., & Kumar, S.
- Venue
- Mathematics of Operations Research
- Published
- 2012-05
- Volume
- 37
- Issue
- 2
- Pages
- 313-345
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W1986352749
- Cited by
- 172
- References
- 19
- FWCI
- 16.64
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.