%0 Journal Article
%T Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
%A Cruz Ch¨¢vez
%A Marco Antonio
%A D¨ªaz Parra
%A Ocotl¨¢n
%J Computaci¨®n y Sistemas
%D 2010
%I Instituto Polit¨¦cnico Nacional
%X 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.
%K memetic algorithm (ga-pcp)
%K constraints satisfaction problem
%K precedence constraint posting
%K local search
%K vrptw.
%U http://www.scielo.org.mx/scielo.php?script=sci_abstract&pid=S1405-55462010000100003&lng=en&nrm=iso&tlng=en