The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Price-Directed Approach to Stochastic Inventory/Routing
Abstract
We consider a new approach to stochastic inventory/routing that approximates the future costs of current actions using optimal dual prices of a linear program. We obtain two such linear programs by formulating the control problem as a Markov decision process and then replacing the optimal value function with the sum of single-customer inventory value functions. The resulting approximation yields statewise lower bounds on optimal infinite-horizon discounted costs. We present a linear program that takes into account inventory dynamics and economics in allocating transportation costs for stochastic inventory routing. On test instances we find that these allocations do not introduce any error in the value function approximations relative to the best approximations that can be achieved without them. Also, unlike other approaches, we do not restrict the set of allowable vehicle itineraries in any way. Instead, we develop an efficient algorithm to both generate and eliminate itineraries during solution of the linear programs and control policy. In simulation experiments, the price-directed policy outperforms other policies from the literature.
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
Cited by
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
Patrick, J., Puterman, M. L., & Queyranne, M. (2008) · Operations Research · doi:10.1287/opre.1080.0590 · Cited by 377
Approximate Dynamic Programming for Ambulance Redeployment
Maxwell, M. S., Restrepo, M., Henderson, S. G., & Topaloglu, H. (2010) · INFORMS Journal on Computing · doi:10.1287/ijoc.1090.0345 · Cited by 283
Integrated supply chain design models: a survey and future research directions
max Shen, Z.-J., & D. O. I. E. &. O. R. (2007) · Journal of Industrial & Management Optimization · doi:10.3934/jimo.2007.3.1 · Cited by 274
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Self-citationA bi-objective stochastic location-inventory-routing model for microalgae-based biofuel supply chain
Asadi, E., Habibi, F., Nickel, S., & Sahebi, H. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.07.067 · Cited by 108
Metadata
- Authors
- Adelman, D.
- Venue
- Operations Research
- Published
- 2004-08
- Volume
- 52
- Issue
- 4
- Pages
- 499-514
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2170412087
- Cited by
- 204
- References
- 1
- FWCI
- 24.83
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Price-Directed Approach to Stochastic Inventory/Routing. https://app.cochat.ai/papers/10.1287/opre.1040.0114
- The paper
- Adelman, D. (2004). A Price-Directed Approach to Stochastic Inventory/Routing. Operations Research. https://doi.org/10.1287/opre.1040.0114
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.