Maximizing the probability of arriving on time: A practical q-learning method
The stochastic shortest path problem is of crucial importance for the development of sustainable transportation systems. Existing methods based on the probability tail model seek for the path that maximizes the probability of arriving at the destination before a deadline. However, they suffer from l...
Saved in:
Main Authors: | CAO, Zhiguang, GUO, Hongliang, ZHANG, Jie, OLIEHOEK, Frans, FASTENRATH, Ulrich |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8131 https://ink.library.smu.edu.sg/context/sis_research/article/9134/viewcontent/11170_Article_Text_14698_1_2_20201228.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Multiagent-based route guidance for increasing the chance of arrival on time
by: CAO, Zhiguang, et al.
Published: (2016) -
Maximizing the probability of arriving on time : a stochastic shortest path problem
by: Cao, Zhiguang
Published: (2017) -
Routing multiple vehicles cooperatively: Minimizing road network breakdown probability
by: GUO Hongliang,, et al.
Published: (2017) -
Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
by: CAO, Zhiguang, et al.
Published: (2016) -
A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
by: Cao, Zhiguang, et al.
Published: (2019)