Time-Dependent Stochastic Vehicle Routing Problem with Random Requests: Application to online police patrol management in Brussels

A hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints.. TRISTAN VIII, Jun 2013, San Pedro de

During the pre-processing phase, the route evaluator fits a PH distribution to each random variable (travel time or service time) in the problem instance.. Then, during the

For each of the three considered solutions, the following information is provided: number of routes employed, base costs (those from the associated CVRP(k) instance), gap between

Let g tj = 1 or 0 depending on whether customer x t is an element of S, or not respectively, and let C (Sj ) be the cost of the TSP solution through the set of customers in

The vehicle routing problem with stochastic demands (VRPSD) consists in designing routes with a minimal expected travel time to satisfy a set of customers with

For routes with stochastic items, a packing problem is solved for every possible scenario to calculate the exact recourse cost of the route and generate a D-optimality cut (40) if

VRPCD-RC is no exception and the main contribution of this paper is on the integration of the scheduling problem associated with the dock resource constraints within a recently

Our main contributions are (i) the study of techniques to reduce the number of extreme points of the uncertainty polytope that must be considered in the model, and (ii)