The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice
Abstract
We consider a network revenue management problem where customers choose among open fare products according to some prespecified choice model. Starting with a Markov decision process (MDP) formulation, we approximate the value function with an affine function of the state vector. We show that the resulting problem provides a tighter bound for the MDP value than the choice-based linear program. We develop a column generation algorithm to solve the problem for a multinomial logit choice model with disjoint consideration sets (MNLD). We also derive a bound as a by-product of a decomposition heuristic. Our numerical study shows the policies from our solution approach can significantly outperform heuristics from the choice-based linear program.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
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
Cited by
Shen, Z. M., & Su, X. (2007) · Production and Operations Management · doi:10.1111/j.1937-5956.2007.tb00291.x · Cited by 337
A Column Generation Algorithm for Choice-Based Network Revenue Management
Bront, J. J. M., Méndez-Díaz, I., & Vulcano, G. (2009) · Operations Research · doi:10.1287/opre.1080.0567 · Cited by 310
Assortment Optimization Under Variants of the Nested Logit Model
Davis, J. M., Gallego, G., & Topaloglu, H. (2014) · Operations Research · doi:10.1287/opre.2014.1256 · Cited by 295
Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters
Rusmevichientong, P., Shmoys, D., Tong, C., & Topaloglu, H. (2014) · Production and Operations Management · doi:10.1111/poms.12191 · Cited by 279
Online routing and battery reservations for electric vehicles with swappable batteries
Adler, J. D., & Mirchandani, P. B. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.09.005 · Cited by 103
Metadata
- Authors
- Zhang, D., & Adelman, D.
- Venue
- Transportation Science
- Published
- 2009-08
- Volume
- 43
- Issue
- 3
- Pages
- 381-394
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W1978976115
- Cited by
- 226
- References
- 2
- FWCI
- 27.60
- 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.