Maximizing the probability of arriving on time : a stochastic shortest path problem
Traffic and transportation are crucial to the sustainable development of most metropolitan cities, where the stochastic shortest path (SSP) problem for vehicle routing is a challenging topic. For this problem, optimization-based methods and multiagent-based methods are usually adopted to compute the...
Saved in:
Main Author: | Cao, Zhiguang |
---|---|
Other Authors: | Zhang Jie |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/69617 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Maximizing the probability of arriving on time: A practical q-learning method
by: CAO, Zhiguang, et al.
Published: (2017) -
Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
by: CAO, Zhiguang, et al.
Published: (2016) -
Novel approach to solving stochastic constrained shortest path problem with quantum computing
by: Yang, Richard Chen Xiao
Published: (2023) -
Shortest Path Problem with Cache-Dependent Path Lengths
by: FU, Z., et al.
Published: (2003) -
Shortest path problem with cache dependent path lengths
by: Fu, Z., et al.
Published: (2016)