2016
DOI: 10.1109/tits.2015.2498160
|View full text |Cite
|
Sign up to set email alerts
|

Finding the Shortest Path in Stochastic Vehicle Routing: A Cardinality Minimization Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0
1

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2
2

Relationship

1
9

Authors

Journals

citations
Cited by 85 publications
(38 citation statements)
references
References 26 publications
0
36
0
1
Order By: Relevance
“…In future, we will study the obstacle avoidance in navigation, where the autonomous ships can be considered as intelligent agents or vehicles. Therefore, we will investigate the routing algorithms for both independent and cooperative agents (or vehicles) in land and marine transportation [31][32][33][34][35][36][37][38], to achieve the obstacle avoidance for autonomous ships.…”
Section: Discussionmentioning
confidence: 99%
“…In future, we will study the obstacle avoidance in navigation, where the autonomous ships can be considered as intelligent agents or vehicles. Therefore, we will investigate the routing algorithms for both independent and cooperative agents (or vehicles) in land and marine transportation [31][32][33][34][35][36][37][38], to achieve the obstacle avoidance for autonomous ships.…”
Section: Discussionmentioning
confidence: 99%
“…For convenience, they are denoted as x 1 , x 2 , x 3 , x 4 . Residents had certain routes to leave and back under certain residential area layout type, and the routes decided travel time, speed, distance and possible conflicts of their trips [32,33]. The routes in the open residential area were different from those in the gated residential area.…”
Section: Examplementioning
confidence: 99%
“…Thus, we reformulate the system model as the cardinality minimization problem to handle this randomness. Since the solution of L1-norm formulation in [5] does not guarantee to be optimal, we directly minimize the cardinality of all samples instead of minimize the total exceeding time of all samples. Furthermore, to speed up the computation, the L-shaped decomposition [9] is applied into the ODPD.…”
Section: Related Workmentioning
confidence: 99%