Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
Fuente:
Redalyc
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artículo científico |
| Lingua: | en |
| Pubblicazione: |
Instituto Politécnico Nacional
2010
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1876430107341488128 |
|---|---|
| author | Marco Antonio Cruz Chávez |
| author_facet | Marco Antonio Cruz Chávez |
| contents | Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique Marco Antonio Cruz Chávez Ocotlán Díaz Parra Computación PCP) VRPTW local search Memetic algorithm (GA Precedence Constraint Posting 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. 2010 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61519182003 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.13 |
| format | Artículo científico |
| id | redalyc_61519182003 |
| institution | Redalyc |
| language | en |
| publishDate | 2010 |
| publisher | Instituto Politécnico Nacional |
| spellingShingle | Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique Marco Antonio Cruz Chávez Computación PCP) VRPTW local search Memetic algorithm (GA Precedence Constraint Posting Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique Marco Antonio Cruz Chávez Ocotlán Díaz Parra Computación PCP) VRPTW local search Memetic algorithm (GA Precedence Constraint Posting 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. 2010 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61519182003 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.13 |
| title | Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique |
| topic | Computación PCP) VRPTW local search Memetic algorithm (GA Precedence Constraint Posting |
| url | https://www.redalyc.org/articulo.oa?id=61519182003 |