Resumo

CRUZ CHAVEZ, Marco Antonio  e  DIAZ PARRA, Ocotlán. Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique. Comp. y Sist. [online]. 2010, vol.13, n.3, pp.257-272. ISSN 2007-9737.

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.

Palavras-chave : Memetic algorithm (GA-PCP); Constraints Satisfaction Problem; Precedence Constraint Posting; local search; VRPTW.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )