{"type":"ScholarlyArticle","title":"Dynamic Vehicle Routing with Stochastic Requests","authors":[{"name":"Russell Bent","slug":"russell-bent","given":"Russell","family":"Bent","affiliation":""},{"name":"Pascal Van Hentenryck","slug":"pascal-van-hentenryck","given":"Pascal","family":"Van Hentenryck","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2003/198","pdf":"https://ijcai.org/proceedings/2003/0198.pdf","markdown":"https://ijcai.org/proceedings/2003/198.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/198","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":198,"pages":{"first":1362,"last":1362},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}