Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach

• 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: Stochastic shortest path; cardinality minimization; l(1)-norm minimization; mixed integer linear programming; Databases and Information Systems
• 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
• Institution: Singapore Management University

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...