Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

Detalhes bibliográficos
Autor(a) principal: Ferreira,Vanessa de Oliveira
Data de Publicação: 2012
Outros Autores: Pureza,Vitória
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000200010
Resumo: In this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.
id SOBRAPO-1_81cc84ffca66ba690edc87b9d0d9f645
oai_identifier_str oai:scielo:S0101-74382012000200010
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymenVehicle routingmultiple deliverymenheuristicscommercial routing systemsIn this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.Sociedade Brasileira de Pesquisa Operacional2012-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000200010Pesquisa Operacional v.32 n.2 2012reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382012005000016info:eu-repo/semantics/openAccessFerreira,Vanessa de OliveiraPureza,Vitóriaeng2012-09-04T00:00:00Zoai:scielo:S0101-74382012000200010Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2012-09-04T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
title Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
spellingShingle Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
Ferreira,Vanessa de Oliveira
Vehicle routing
multiple deliverymen
heuristics
commercial routing systems
title_short Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
title_full Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
title_fullStr Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
title_full_unstemmed Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
title_sort Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
author Ferreira,Vanessa de Oliveira
author_facet Ferreira,Vanessa de Oliveira
Pureza,Vitória
author_role author
author2 Pureza,Vitória
author2_role author
dc.contributor.author.fl_str_mv Ferreira,Vanessa de Oliveira
Pureza,Vitória
dc.subject.por.fl_str_mv Vehicle routing
multiple deliverymen
heuristics
commercial routing systems
topic Vehicle routing
multiple deliverymen
heuristics
commercial routing systems
description In this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.
publishDate 2012
dc.date.none.fl_str_mv 2012-08-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000200010
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000200010
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382012005000016
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.32 n.2 2012
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318017414168576

Registros relacionados