ML Anthology

Dynamic Vehicle Routing with Stochastic Requests

Russell Bent, Pascal Van Hentenryck
IJCAI 2003 pp. 1362-1363
/ijcai/2003/bent2003ijcai-dynamic/

Abstract

This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables which are realized dynamically during plan execution. It studies a multiple scenario approach (MSA) which continuously generates plans consistent with past decisions and anticipating future requests, and compares it with the best available heuristics on dynamic VRP problems that model long-distance courier mail services [13]. In addition, it proposes a least-commitment refinement of MSA (MSA-LC), which also uses stochastic information to delay vehicle departures opportunistically. Experimental results shows that MSA, and MSA-LC in particular, may significantly decrease travel times (while not degrading service) and is robust with respect to reasonably noisy distributions. 1

PDF Semantic Scholar

Cite

Text

Bent and Van Hentenryck. "Dynamic Vehicle Routing with Stochastic Requests." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Bent and Van Hentenryck. "Dynamic Vehicle Routing with Stochastic Requests." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/bent2003ijcai-dynamic/)

BibTeX

@inproceedings{bent2003ijcai-dynamic,
  title     = {{Dynamic Vehicle Routing with Stochastic Requests}},
  author    = {Bent, Russell and Van Hentenryck, Pascal},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1362-1363},
  url       = {https://mlanthology.org/ijcai/2003/bent2003ijcai-dynamic/}
}