A comparison of recombination operators for capacitate vehicle routing problem

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of t...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Graglia, Patricia, Stark, Natalia, Alfonso, Hugo, Salto, Carolina
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2008
Materias:
Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21690
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21690
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
spellingShingle Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
Graglia, Patricia
Stark, Natalia
Alfonso, Hugo
Salto, Carolina
A comparison of recombination operators for capacitate vehicle routing problem
topic_facet Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
description The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. Taking a basic GA to solve the CVRP, we propose a new problem dependent recombination operator, called Best Route Better Adjustment recombination (BRBAX). A comparison of its performance is carried out with respect to other two classical recombination operators. Also we conduct a study of different mutations in order to determine the best combination of genetic operators for this problem. The results show that the use of our specialized BRBAX recombination outperforms the others more generic on all problem instances used in this work for all the metrics tested.
format Objeto de conferencia
Objeto de conferencia
author Graglia, Patricia
Stark, Natalia
Alfonso, Hugo
Salto, Carolina
author_facet Graglia, Patricia
Stark, Natalia
Alfonso, Hugo
Salto, Carolina
author_sort Graglia, Patricia
title A comparison of recombination operators for capacitate vehicle routing problem
title_short A comparison of recombination operators for capacitate vehicle routing problem
title_full A comparison of recombination operators for capacitate vehicle routing problem
title_fullStr A comparison of recombination operators for capacitate vehicle routing problem
title_full_unstemmed A comparison of recombination operators for capacitate vehicle routing problem
title_sort comparison of recombination operators for capacitate vehicle routing problem
publishDate 2008
url http://sedici.unlp.edu.ar/handle/10915/21690
work_keys_str_mv AT gragliapatricia acomparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT starknatalia acomparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT alfonsohugo acomparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT saltocarolina acomparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT gragliapatricia comparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT starknatalia comparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT alfonsohugo comparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
AT saltocarolina comparisonofrecombinationoperatorsforcapacitatevehicleroutingproblem
bdutipo_str Repositorios
_version_ 1764820464808493058

Ejemplares similares