Algoritmo Evolutivo para el Problema de Ruteo de Vehículos con Ventanas de Tiempo Basado en una Técnica de Satisfacción de Restricciones

IN THIS PAPER A MEMETIC ALGORITHM (MA) IS PROPOSED FOR SOLVING THE VEHICLES ROUTING PROBLEM WITH TIME WIN-DOWS (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.