A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands

Abstract

This chapter introduces a new hybrid algorithmic approach based on the Differential Evolution (DE) algorithm for successfully solving a number of routing problems with stochastic variables. More precisely, we solve one problem with stochastic customers, the Probabilistic Traveling Salesman Problem and one problem with stochastic demands, the Vehicle Routing Problem with Stochastic Demands. The proposed algorithm uses a Variable Neighborhood Search algorithm in order to increase the exploitation abilities of the algorithm. The algorithm is tested on a number of benchmark instances from the literature and it is compared with a hybrid Genetic Algorithm.