Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique

dc.creatorCruz Chávez, Marco Antonio
dc.creatorDíaz Parra, Ocotlán
dc.date.accessioned2013-05-03T23:23:04Z
dc.date.available2013-05-03T23:23:04Z
dc.date.created2013-05-03T23:23:04Z
dc.date.issued2010-02-18
dc.identifierRevista Computación y Sistemas; Vol. 13 No.3
dc.identifier1405-5546
dc.identifierhttp://www.repositoriodigital.ipn.mx/handle/123456789/15573
dc.description.abstractAbstract. 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.
dc.languageen_US
dc.publisherRevista Computación y Sistemas; Vol. 13 No.3
dc.relationRevista Computación y Sistemas;Vol. 13 No. 3
dc.subjectKeyWords. Memetic algorithm (GA-PCP), Constraints Satisfaction Problem, Precedence Constraint Posting, lo-cal search, VRPTW.
dc.titleEvolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
dc.typeArticle


Este ítem pertenece a la siguiente institución