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...
Hoofdauteurs: | Adulyasak, Yossiri, Jaillet, Patrick |
---|---|
Andere auteurs: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Formaat: | Artikel |
Taal: | en_US |
Gepubliceerd in: |
Institute for Operations Research and the Management Sciences (INFORMS)
2017
|
Online toegang: | http://hdl.handle.net/1721.1/111099 https://orcid.org/0000-0002-8585-6566 |
Gelijkaardige items
-
The Robust Vehicle Routing Problem with Time Window Assignments
door: Hoogeboom, Maaike, et al.
Gepubliceerd in: (2022) -
Decentralized stochastic planning with anonymity in interactions
door: Varakantham, Pradeep, et al.
Gepubliceerd in: (2015) -
Regret Based Robust Solutions for Uncertain Markov Decision Processes
door: Ahmed, Asrar, et al.
Gepubliceerd in: (2015) -
Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing Systems
door: Ghosh, Supriyo, et al.
Gepubliceerd in: (2015) -
Optimism, deadline effect, and stochastic deadlines
door: Yildiz, Muhamet
Gepubliceerd in: (2011)