Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines
We consider the vehicle routing problem with deadlines under travel time uncertainty in the contexts of stochastic and robust optimization. The problem is defined on a directed graph where a fleet of vehicles is required to visit a given set of nodes and deadlines are imposed at a subset of nodes. I...
Main Authors: | Adulyasak, Yossiri (Author), Jaillet, Patrick (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Operations Research Center (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS),
2017-09-01T13:29:26Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The Robust Vehicle Routing Problem with Time Window Assignments
by: Hoogeboom, Maaike, et al.
Published: (2022) -
Decentralized stochastic planning with anonymity in interactions
by: Varakantham, Pradeep, et al.
Published: (2015) -
Regret Based Robust Solutions for Uncertain Markov Decision Processes
by: Ahmed, Asrar, et al.
Published: (2015) -
Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing Systems
by: Ghosh, Supriyo, et al.
Published: (2015) -
Solving uncertain MDPs with objectives that are separable over instantiations of model uncertainty
by: Adulyasak, Yossiri, et al.
Published: (2018)