Dynamic Vehicle Routing with Stochastic Requests

Bent, Russell; Van Hentenryck, Pascal

Dynamic Vehicle Routing with Stochastic Requests

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1362-1362.

Abstract

This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It proposes a multiple scenario approach (MSA) that continuously generates plans consistent with past decisions and anticipating future requests. The approach, which combines AI and OR techniques in novel ways, is compared with the best available heuristics that model longdistance courier mail services [Larsen eta!., 2002]. Experimental results shows that MSA may significantly decrease travel times and is robust wrt reasonably noisy distributions.

Russell Bent, and Pascal Van Hentenryck. 2003. Dynamic Vehicle Routing with Stochastic Requests. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1362–1362. https://ijcai.org/proceedings/2003/198

@inproceedings{ijcai2003p198,
  title     = {Dynamic Vehicle Routing with Stochastic Requests},
  author    = {Bent, Russell and Van Hentenryck, Pascal},
  booktitle = {Proceedings of the Eighteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-03}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Georg Gottlob},
  pages     = {1362--1362},
  year      = {2003},
  url       = {https://ijcai.org/proceedings/2003/198},
}

TY  - CPAPER
TI  - Dynamic Vehicle Routing with Stochastic Requests
AU  - Bent, Russell
AU  - Van Hentenryck, Pascal
T2  - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2003
SP  - 1362
EP  - 1362
UR  - https://ijcai.org/proceedings/2003/198
ER  -