A multi population memetic algorithm for the vehicle routing problem with time windows and stochastic travel and service times
Résumé
This paper presents a new model to solve the Vehicle Routing Problem with Time Windows and Stochastic Travel and Service Times. The model allows ensuring service levels at the solution, on depot’s time window, and at each client. The problem is solved via a Multi Population Memetic Algorithm where each population tackles the problem using a different strategy while sharing information across the populations. The solution approach is tested on modified instances proposed by Solomon for the deterministic counterpart. Preliminary results show that the proposed method guarantees a high service level with an increase of 29.65% on the fleet size when comparing with the best deterministic solution found.