… the stochastic shortest path (SSP) problem for vehicle routing … optimization-based methods
and multiagent-based methods … the cardinality minimization), a practical Q-learning method is …

… In contrast, this paper presents a model for minimizing the generalized cost of travel, formulated
as a … The general approach for solving deterministic shortest path problems is dynamic …

… approach is to use a large set of historical customer demand and traveling time which can
improve the accuracy of the vehicle routing … ] adopted the shortest path with deadline violation …

… and the total expected routing cost is minimized. The VRPSD … , there are other modeling
approaches for the problem, such … Concerning complexity, assuming that the cardinalities of the …

… Abstract—This paper focuses on a specific stochastic shortest path (SSP) problem, namely
… , “Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach,…

… The objective is to minimize the sum of the routing and … By applying this idea to LBFs, we
obtain an approach for generating … has a set Ij of two-dimensional items of cardinality mj. Then, …

… Often, the pricing phase in Vehicle Routing Problems (VRP) … It is possible to adapt this kind
of approach to the unconstrained … Let n and m be the cardinality of V and A, respectively. A …

… The objective is to find a first-stage solution that minimizes the cost of the first stage and the
… methods have shown to be efficient for instances that require a large number of short routes, …

… optimal paths, and second, their subpaths are nondominated, which can be used for pruning.
Multiple properties of essential paths are exploited in our exact solution method… to minimize …

… method, which only needs to solve two deterministic shortest … to minimize the sum of path
travel time and expected path delay … bound by extending the project property of random vectors. …