The Static and Stochastic VRPTW with both random Customers and Reveal Times: algorithms and recourse strategies

08/10/2017
by   Michael Saint-Guillain, et al.
0

Unlike its deterministic counterpart, static and stochastic vehicle routing problems (SS-VRP) aim at modeling and solving real-life operational problems by considering uncertainty on data. We consider the SS-VRPTW-CR introduced in Saint-Guillain et al. (2017). Like the SS-VRP introduced by Bertsimas (1992), we search for optimal first stage routes for a fleet of vehicles to handle a set of stochastic customer demands, i.e., demands are uncertain and we only know their probabilities. In addition to capacity constraints, customer demands are also constrained by time windows. Unlike all SS-VRP variants, the SS-VRPTW-CR does not make any assumption on the time at which a stochastic demand is revealed, i.e., the reveal time is stochastic as well. To handle this new problem, we introduce waiting locations: Each vehicle is assigned a sequence of waiting locations from which it may serve some associated demands, and the objective is to minimize the expected number of demands that cannot be satisfied in time. In this paper, we propose two new recourse strategies for the SS-VRPTW-CR, together with their closed-form expressions for efficiently computing their expectations: The first one allows us to take vehicle capacities into account; The second one allows us to optimize routes by avoiding some useless trips. We propose two algorithms for searching for routes with optimal expected costs: The first one is an extended branch-and-cut algorithm, based on a stochastic integer formulation, and the second one is a local search based heuristic method. We also introduce a new public benchmark for the SS-VRPTW-CR, based on real-world data coming from the city of Lyon. We evaluate our two algorithms on this benchmark and empirically demonstrate the expected superiority of the SS-VRPTW-CR anticipative actions over a basic "wait-and-serve" policy.

READ FULL TEXT
research
02/08/2019

Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times

Static stochastic VRPs aim at modeling real-life VRPs by considering unc...
research
10/10/2018

Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty

This paper studies robust variants of an extended model of the classical...
research
08/23/2019

Optimal Heterogeneous Asset Location Modeling for Expected Spatiotemporal Search and Rescue Demands using Historic Event Data

The United States Coast Guard is charged with the coordination of all se...
research
08/26/2020

A Three-Stage Algorithm for the Large Scale Dynamic Vehicle Routing Problem with an Industry 4.0 Approach

Industry 4.0 is a concept which helps companies to have a smart supply c...
research
10/29/2021

Location-routing Optimisation for Urban Logistics Using Mobile Parcel Locker Based on Hybrid Q-Learning Algorithm

Mobile parcel lockers (MPLs) have been recently introduced by urban logi...

Please sign up or login with your details

Forgot password? Click here to reset