A multi population memetic algorithm for the vehicle routing problem with time windows and stochastic travel and service times

Andres Gutierrez (1) , Laurence Dieulle (2) , Nacima Labadie (3) , Nubia M. Velasco (1)

1 UNIANDES - Universidad de los Andes [Bogota]
2 LM2S - Laboratoire Modélisation et Sûreté des Systèmes
3 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

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.

Domains: Engineering Sciences [physics]

Andres Gutierrez, Laurence Dieulle, Nacima Labadie, Nubia M. Velasco. A multi population memetic algorithm for the vehicle routing problem with time windows and stochastic travel and service times. 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016, Jun 2016, Troyes, France. pp.1204-1209, ⟨10.1016/j.ifacol.2016.07.673⟩. ⟨hal-02586025⟩