Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique

in this paper a memetic algorithm (ma) is proposed for solving the vehicles routing problem with time windows (vrptw) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions that represent the individuals of the population. an evolutionary heuristic is applied in order to establish the crossover and mutation between sub-routes. the results of ma demonstrate that the use of constraints satisfaction technique permits ma to work more efficiently in the vrptw.