Publications

@inbook{BC3,

title = { Memetic Algorithm Based on a Constraint Satisfaction Technique for VRPTW},

author = {Marco A. Cruz-Chávez and Ocotlán Díaz-Parra and David Juárez-Romero and Martín G. Martínez-Rangel},

url = {https://link.springer.com/chapter/10.1007/978-3-540-69731-2_37},

doi = {10.1007/978-3-540-69731-2_37},

isbn = {978-3-540-69572-1},

year  = {2008},

date = {2008-02-07},

volume = {5097},

pages = {376-387},

publisher = {Springer, Berlin, Heidelberg},

series = {Lecture Notes in Artificial Intelligence},

abstract = {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. 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.},

keywords = {chapters, Memetic Algorithm},

pubstate = {published},

tppubtype = {inbook}

}