A recourse programming model for the VRPTW with evidential service and travel times

This paper addresses the vehicle routing problem with time windows where service and travel times are subject to information imperfections.We propose to handle those imperfections within the ramework of belief function as it allows for a better representation of several facets of uncertainty including probabilistic uncertainty and imprecision. An extension of stochastic programming with recourse is used to tackle the problem. This approach aims to regain the feasibility of the routes on which one or more of the customers could not have been serviced on time due to the uncertain nature of the problem. A memetic algorithm is devised to solve an adaptation of literature instances.