Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
This paper aims at solving the stochastic shortest path problem in vehicle routing, the objective of which is to determine an optimal path that maximizes the probability of arriving at the destination before a given deadline. To solve this problem, we propose a data-driven approach, which directly e...
Saved in:
Main Authors: | CAO, Zhiguang, GUO, Hongliang, ZHANG, Jie, NIYATO, Dusit, FASTENRATH, Ulrich Fastenrath |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8194 https://ink.library.smu.edu.sg/context/sis_research/article/9197/viewcontent/FindingtheShortestPathinStochasticVehicleRouting_ACardinalityMinimizationApproach.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
An accurate solution to the cardinality-based punctuality problem
by: Cao, Zhiguang, et al.
Published: (2020) -
GP3: Gaussian process path planning for reliable shortest path in transportation networks
by: GUO, Hongliang, et al.
Published: (2021) -
An accurate solution to the cardinality-based punctuality problem
by: CAO, Zhiguang, et al.
Published: (2020) -
Efficient navigation for constrained shortest path with adaptive expansion control
by: XIA, Wenwen, et al.
Published: (2022) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017)