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...
Main Author: | Cao, Zhiguang |
---|---|
Other Authors: | Zhang Jie |
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/69617 |
Similar Items
-
Stochastic shortest path problems with recourse
Published: (2003) -
An analysis of stochastic shortest path problems
Published: (2003) -
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014) -
Stochastic and shortest path games : theory and algorithms
by: Patek, Stephen D. (Stephen David)
Published: (2005) -
Shortest path computation for roadway network
by: Khoo, Gilbert Teng Sheng
Published: (2016)