2016
DOI: 10.1007/978-3-319-50349-3_23
|View full text |Cite
|
Sign up to set email alerts
|

Risk-Averse Anticipation for Dynamic Vehicle Routing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…In studies related to a vehicle routing problem, Novoa and Storer (2009) [30] examined an approximate dynamic programming algorithm for the single-vehicle routing problem with stochastic demands from a dynamic perspective and confirmed the efficient Rollout Algorithms (RAs) for solving the single VRPSD (Vehicle Routing Problem with Split Deliveries) under a dynamic approach. Ulmer and Voß (2016) [31] analyzed how risk-aversion impacted solutions' quality and variance by integrating risk-aversion into ADP methods. Ulmer (2018) [32] incorporated temporal and spatial anticipation of service requests into Approximate Dynamic Programming (ADP) procedures to yield dynamic routing policies for the un-capacitated single-vehicle routing problem with stochastic service requests.…”
Section: Methods For Anticipatory Cooperative Strategymentioning
confidence: 99%
“…In studies related to a vehicle routing problem, Novoa and Storer (2009) [30] examined an approximate dynamic programming algorithm for the single-vehicle routing problem with stochastic demands from a dynamic perspective and confirmed the efficient Rollout Algorithms (RAs) for solving the single VRPSD (Vehicle Routing Problem with Split Deliveries) under a dynamic approach. Ulmer and Voß (2016) [31] analyzed how risk-aversion impacted solutions' quality and variance by integrating risk-aversion into ADP methods. Ulmer (2018) [32] incorporated temporal and spatial anticipation of service requests into Approximate Dynamic Programming (ADP) procedures to yield dynamic routing policies for the un-capacitated single-vehicle routing problem with stochastic service requests.…”
Section: Methods For Anticipatory Cooperative Strategymentioning
confidence: 99%