A Hybrid Algorithm for the Vehicle Routing Problem with Window
Autor(a) principal: | |
---|---|
Data de Publicação: | 2004 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87 |
Resumo: | The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms. A genetic algorithm and a set partitioning two phases approach has obtained competitive results in terms of total travel distance minimization. However, a great number of heuristics has used the number of vehicles as the first objective and travel distance as the second, subject to the first. This paper proposes a three phases approach considering both objectives. Initially, a hierarchical tournament selection genetic algorithm is applied. It can reach all best results in number of vehicles of the 56 Solomon’s problems explored in the literature. After then, the two phase approach, the genetic and the set partitioning, is applied to minimize the travel distance as the second objective. |
id |
UFLA-5_bf59a24ff93c00ef3a193297d1880e72 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/87 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
A Hybrid Algorithm for the Vehicle Routing Problem with Windowvehicle routinghybrid genetic algorithmhierarchical tournament selectionThe Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms. A genetic algorithm and a set partitioning two phases approach has obtained competitive results in terms of total travel distance minimization. However, a great number of heuristics has used the number of vehicles as the first objective and travel distance as the second, subject to the first. This paper proposes a three phases approach considering both objectives. Initially, a hierarchical tournament selection genetic algorithm is applied. It can reach all best results in number of vehicles of the 56 Solomon’s problems explored in the literature. After then, the two phase approach, the genetic and the set partitioning, is applied to minimize the travel distance as the second objective.Editora da UFLA2004-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87INFOCOMP Journal of Computer Science; Vol. 4 No. 2 (2005): June, 2005; 9-161982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87/72Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessAlvarenga, Guilherme BastosSilva, Ricardo Martins de AbreuSampaio, Rudini Menezes2015-06-22T12:31:55Zoai:infocomp.dcc.ufla.br:article/87Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:16.164736INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
title |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
spellingShingle |
A Hybrid Algorithm for the Vehicle Routing Problem with Window Alvarenga, Guilherme Bastos vehicle routing hybrid genetic algorithm hierarchical tournament selection |
title_short |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
title_full |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
title_fullStr |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
title_full_unstemmed |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
title_sort |
A Hybrid Algorithm for the Vehicle Routing Problem with Window |
author |
Alvarenga, Guilherme Bastos |
author_facet |
Alvarenga, Guilherme Bastos Silva, Ricardo Martins de Abreu Sampaio, Rudini Menezes |
author_role |
author |
author2 |
Silva, Ricardo Martins de Abreu Sampaio, Rudini Menezes |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Alvarenga, Guilherme Bastos Silva, Ricardo Martins de Abreu Sampaio, Rudini Menezes |
dc.subject.por.fl_str_mv |
vehicle routing hybrid genetic algorithm hierarchical tournament selection |
topic |
vehicle routing hybrid genetic algorithm hierarchical tournament selection |
description |
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms. A genetic algorithm and a set partitioning two phases approach has obtained competitive results in terms of total travel distance minimization. However, a great number of heuristics has used the number of vehicles as the first objective and travel distance as the second, subject to the first. This paper proposes a three phases approach considering both objectives. Initially, a hierarchical tournament selection genetic algorithm is applied. It can reach all best results in number of vehicles of the 56 Solomon’s problems explored in the literature. After then, the two phase approach, the genetic and the set partitioning, is applied to minimize the travel distance as the second objective. |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87/72 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 4 No. 2 (2005): June, 2005; 9-16 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740048887808 |