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: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/111099 https://orcid.org/0000-0002-8585-6566 |