A comparison of recombination operators for capacitate vehicle routing problem

Autores
Graglia, Patricia; Stark, Natalia; Alfonso, Hugo; Salto, Carolina
Año de publicación
2008
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Workshop de Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/21690
Acceder
id SEDICI_30439585ab7ce56d8f0eb76f6289ed7f
oai_identifier_str oai:sedici.unlp.edu.ar:10915/21690
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A comparison of recombination operators for capacitate vehicle routing problemGraglia, PatriciaStark, NataliaAlfonso, HugoSalto, CarolinaCiencias Informáticascapacitated vehicle routing problemrecombinationgenetic algorithmsThe 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.Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2008-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/21690enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:54:43Zoai:sedici.unlp.edu.ar:10915/21690Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:54:43.405SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A comparison of recombination operators for capacitate vehicle routing problem
title A comparison of recombination operators for capacitate vehicle routing problem
spellingShingle A comparison of recombination operators for capacitate vehicle routing problem
Graglia, Patricia
Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
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 A comparison of recombination operators for capacitate vehicle routing problem
dc.creator.none.fl_str_mv Graglia, Patricia
Stark, Natalia
Alfonso, Hugo
Salto, Carolina
author Graglia, Patricia
author_facet Graglia, Patricia
Stark, Natalia
Alfonso, Hugo
Salto, Carolina
author_role author
author2 Stark, Natalia
Alfonso, Hugo
Salto, Carolina
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
topic Ciencias Informáticas
capacitated vehicle routing problem
recombination
genetic algorithms
dc.description.none.fl_txt_mv 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.
Workshop de Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2008
dc.date.none.fl_str_mv 2008-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/21690
url http://sedici.unlp.edu.ar/handle/10915/21690
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615805500653568
score 13.070432

Publicaciones similares