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

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 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.

Saved in:
Bibliographic Details
Main Authors: Cruz Chávez,Marco Antonio, Díaz Parra,Ocotlán
Format: Digital revista
Language:English
Published: Instituto Politécnico Nacional, Centro de Investigación en Computación 2010
Online Access:http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462010000100003
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:scielo:S1405-55462010000100003
record_format ojs
spelling oai:scielo:S1405-554620100001000032010-08-02Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction TechniqueCruz Chávez,Marco AntonioDíaz Parra,Ocotlán Memetic algorithm (GA-PCP) Constraints Satisfaction Problem Precedence Constraint Posting local search VRPTW 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.info:eu-repo/semantics/openAccessInstituto Politécnico Nacional, Centro de Investigación en ComputaciónComputación y Sistemas v.13 n.3 20102010-03-01info:eu-repo/semantics/articletext/htmlhttp://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462010000100003en
institution SCIELO
collection OJS
country México
countrycode MX
component Revista
access En linea
databasecode rev-scielo-mx
tag revista
region America del Norte
libraryname SciELO
language English
format Digital
author Cruz Chávez,Marco Antonio
Díaz Parra,Ocotlán
spellingShingle Cruz Chávez,Marco Antonio
Díaz Parra,Ocotlán
Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
author_facet Cruz Chávez,Marco Antonio
Díaz Parra,Ocotlán
author_sort Cruz Chávez,Marco Antonio
title Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
title_short Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
title_full Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
title_fullStr Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
title_full_unstemmed Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
title_sort evolutionary algorithm for the vehicles routing problem with time windows based on a constraint satisfaction technique
description 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.
publisher Instituto Politécnico Nacional, Centro de Investigación en Computación
publishDate 2010
url http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462010000100003
work_keys_str_mv AT cruzchavezmarcoantonio evolutionaryalgorithmforthevehiclesroutingproblemwithtimewindowsbasedonaconstraintsatisfactiontechnique
AT diazparraocotlan evolutionaryalgorithmforthevehiclesroutingproblemwithtimewindowsbasedonaconstraintsatisfactiontechnique
_version_ 1756225725315153920

Similar Items