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 pop...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | México |
| Recursos: | Universidad Autónoma del Estado de Morelos |
| Repositorio: | Redalyc-UAEM |
| OAI Identifier: | oai:redalyc.org:61519182003 |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=61519182003 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computación PCP) VRPTW local search Memetic algorithm (GA Precedence Constraint Posting |
| Resumo: | 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. |
|---|