A Vehicle Routing Problem with Stochastic Demand
DOI10.1287/OPRE.40.3.574zbMATH Open0754.60103OpenAlexW1984143531WikidataQ96141538 ScholiaQ96141538MaRDI QIDQ4016944FDOQ4016944
Authors: L. D. Servi, Dimitris Bertsimas 
Publication date: 16 January 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.3.574
Recommendations
- The Queue Inference Engine: Deducing Queue Statistics from Transactional Data
- Inferring most likely queue length from transactional data
- Estimating Waiting Times from Transactional Data
- Queue inference from periodic reporting data
- Exploiting Markov chains to infer queue length from transactional data
computational resultsexpected transient queue length during a busy periodtime-varying Poisson process
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (12)
- The Queue Inference Engine: Deducing Queue Statistics from Transactional Data
- Exploiting Markov chains to infer queue length from transactional data
- Robust queue inference from waiting times
- Supervised ML for solving the \(GI/GI/1\) queue
- Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference
- A statistical Markov chain approximation of transient hospital inpatient inventory
- Queue inference from periodic reporting data
- Estimating customer delay and tardiness sensitivity from periodic queue length observations
- A survey of parameter and state estimation in queues
- Remarks on queue inference from departure data alone and the importance of the queue inference engine
- Inferring most likely queue length from transactional data
- Robust optimization for the vehicle routing problem with multiple deliverymen
This page was built for publication: A Vehicle Routing Problem with Stochastic Demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016944)
