The capacitated vehicle routing problem with alternative objective functions
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Tipo de documento: | Dissertação |
Idioma: | eng |
Título da fonte: | Repositório Institucional da Universidade Federal Fluminense (RIUFF) |
Texto Completo: | http://app.uff.br/riuff/handle/1/29833 |
Resumo: | [EN] The Capacitated Vehicle Routing Problem (CVRP) deals with minimizing the total distance traveled by the routes and is widely studied in the literature. Despite having many applications, such as in the distribution of consumer goods, several authors in the literature have had the perception that the classic CVRP does not apply to other cases, such as, for example, school bus routing or emergency aid distribution in case of large disasters. Therefore, variants with alternative objective functions for this problem have been proposed in the literature in order to assure satisfactory solutions in these scenarios. This dissertation studies three CVRP variants proposing a Branch-cut-and-price model for each one. The first variant discussed here is the Cumulative CVRP, where the objective is to minimize the sum of arrival times for all customers. The second variant studied in this work is the Min-Max CVRP, which aims at minimizing the distance covered by the longest route and is a well-known method of balancing routes. The third variant, CVRP with a balanced number of customers, was proposed in this work and aims to ensure a balance of routes in terms of the number of customers visited by each vehicle |
id |
UFF-2_b23034c90aa9ad0564b213388beb59eb |
---|---|
oai_identifier_str |
oai:app.uff.br:1/29833 |
network_acronym_str |
UFF-2 |
network_name_str |
Repositório Institucional da Universidade Federal Fluminense (RIUFF) |
repository_id_str |
2120 |
spelling |
The capacitated vehicle routing problem with alternative objective functionsBranch-cut-and-priceCVRPCumulative CVRPMin-max CVRPRoute balancingCVRP with balanced number of customersProblema de roteamento de veículoRoteamentoCVRP CumulativoBalanceamento de rotasCVRP com número de clientes balanceado[EN] The Capacitated Vehicle Routing Problem (CVRP) deals with minimizing the total distance traveled by the routes and is widely studied in the literature. Despite having many applications, such as in the distribution of consumer goods, several authors in the literature have had the perception that the classic CVRP does not apply to other cases, such as, for example, school bus routing or emergency aid distribution in case of large disasters. Therefore, variants with alternative objective functions for this problem have been proposed in the literature in order to assure satisfactory solutions in these scenarios. This dissertation studies three CVRP variants proposing a Branch-cut-and-price model for each one. The first variant discussed here is the Cumulative CVRP, where the objective is to minimize the sum of arrival times for all customers. The second variant studied in this work is the Min-Max CVRP, which aims at minimizing the distance covered by the longest route and is a well-known method of balancing routes. The third variant, CVRP with a balanced number of customers, was proposed in this work and aims to ensure a balance of routes in terms of the number of customers visited by each vehicleO Problema de Roteamento de Veículos Capacitado (CVRP) trata da minimização da distância total percorrida pelas rotas e é amplamente estudado na literatura. Apesar de ter muitas aplicações como na distribuição de bens de consumo, vários autores na literatura tiveram a percepção de que o CVRP clássico não se aplica em outros casos, como por exemplo, em roteamento de ônibus escolares ou distribuição de auxílio emergencial em caso de grandes desastres. Portanto, variantes com funções objetivo alternativas deste problema têm sido propostas na literatura com o fim de garantir soluções satisfatórias nestes cenários. Esta dissertação estuda três variantes do CVRP propondo um modelo de Branch-cut-and-price para cada uma delas. A primeira variante aqui abordada é o CVRP Cumulativo onde o objetivo é minimizar o somatório dos tempos de chegada a todos os clientes. A segunda variante estudada neste trabalho é o Min-Max CVRP que tem por objetivo a minimização da distância percorrida pela maior rota e é um conhecido método de balanceamento de rotas. A terceira variante, o CVRP com número balanceado de clientes, foi proposta neste trabalho e tem por objetivo garantir um balanceamento de rotas em termos da quantidade de clientes visitada por cada veículo.76 p.Barboza, Eduardo UchoaPessoa, Artur AlvesSadykov, RuslanDamião, Caio Marinho2023-08-08T16:43:53Z2023-08-08T16:43:53Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfDAMIÃO, Caio Marinho. The capacitated vehicle routing problem with alternative objective functions 2021. 76 f. Dissertação (Mestrado em Engenharia de Produção) – Programa de Pós-Graduação em Engenharia de Produção, Escola de Engenharia, Universidade Federal Fluminense, Niterói, 2021.http://app.uff.br/riuff/handle/1/29833CC-BY-SAinfo:eu-repo/semantics/openAccessengreponame:Repositório Institucional da Universidade Federal Fluminense (RIUFF)instname:Universidade Federal Fluminense (UFF)instacron:UFF2023-08-08T16:43:57Zoai:app.uff.br:1/29833Repositório InstitucionalPUBhttps://app.uff.br/oai/requestriuff@id.uff.bropendoar:21202023-08-08T16:43:57Repositório Institucional da Universidade Federal Fluminense (RIUFF) - Universidade Federal Fluminense (UFF)false |
dc.title.none.fl_str_mv |
The capacitated vehicle routing problem with alternative objective functions |
title |
The capacitated vehicle routing problem with alternative objective functions |
spellingShingle |
The capacitated vehicle routing problem with alternative objective functions Damião, Caio Marinho Branch-cut-and-price CVRP Cumulative CVRP Min-max CVRP Route balancing CVRP with balanced number of customers Problema de roteamento de veículo Roteamento CVRP Cumulativo Balanceamento de rotas CVRP com número de clientes balanceado |
title_short |
The capacitated vehicle routing problem with alternative objective functions |
title_full |
The capacitated vehicle routing problem with alternative objective functions |
title_fullStr |
The capacitated vehicle routing problem with alternative objective functions |
title_full_unstemmed |
The capacitated vehicle routing problem with alternative objective functions |
title_sort |
The capacitated vehicle routing problem with alternative objective functions |
author |
Damião, Caio Marinho |
author_facet |
Damião, Caio Marinho |
author_role |
author |
dc.contributor.none.fl_str_mv |
Barboza, Eduardo Uchoa Pessoa, Artur Alves Sadykov, Ruslan |
dc.contributor.author.fl_str_mv |
Damião, Caio Marinho |
dc.subject.por.fl_str_mv |
Branch-cut-and-price CVRP Cumulative CVRP Min-max CVRP Route balancing CVRP with balanced number of customers Problema de roteamento de veículo Roteamento CVRP Cumulativo Balanceamento de rotas CVRP com número de clientes balanceado |
topic |
Branch-cut-and-price CVRP Cumulative CVRP Min-max CVRP Route balancing CVRP with balanced number of customers Problema de roteamento de veículo Roteamento CVRP Cumulativo Balanceamento de rotas CVRP com número de clientes balanceado |
description |
[EN] The Capacitated Vehicle Routing Problem (CVRP) deals with minimizing the total distance traveled by the routes and is widely studied in the literature. Despite having many applications, such as in the distribution of consumer goods, several authors in the literature have had the perception that the classic CVRP does not apply to other cases, such as, for example, school bus routing or emergency aid distribution in case of large disasters. Therefore, variants with alternative objective functions for this problem have been proposed in the literature in order to assure satisfactory solutions in these scenarios. This dissertation studies three CVRP variants proposing a Branch-cut-and-price model for each one. The first variant discussed here is the Cumulative CVRP, where the objective is to minimize the sum of arrival times for all customers. The second variant studied in this work is the Min-Max CVRP, which aims at minimizing the distance covered by the longest route and is a well-known method of balancing routes. The third variant, CVRP with a balanced number of customers, was proposed in this work and aims to ensure a balance of routes in terms of the number of customers visited by each vehicle |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-08-08T16:43:53Z 2023-08-08T16:43:53Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
DAMIÃO, Caio Marinho. The capacitated vehicle routing problem with alternative objective functions 2021. 76 f. Dissertação (Mestrado em Engenharia de Produção) – Programa de Pós-Graduação em Engenharia de Produção, Escola de Engenharia, Universidade Federal Fluminense, Niterói, 2021. http://app.uff.br/riuff/handle/1/29833 |
identifier_str_mv |
DAMIÃO, Caio Marinho. The capacitated vehicle routing problem with alternative objective functions 2021. 76 f. Dissertação (Mestrado em Engenharia de Produção) – Programa de Pós-Graduação em Engenharia de Produção, Escola de Engenharia, Universidade Federal Fluminense, Niterói, 2021. |
url |
http://app.uff.br/riuff/handle/1/29833 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
CC-BY-SA info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
CC-BY-SA |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da Universidade Federal Fluminense (RIUFF) instname:Universidade Federal Fluminense (UFF) instacron:UFF |
instname_str |
Universidade Federal Fluminense (UFF) |
instacron_str |
UFF |
institution |
UFF |
reponame_str |
Repositório Institucional da Universidade Federal Fluminense (RIUFF) |
collection |
Repositório Institucional da Universidade Federal Fluminense (RIUFF) |
repository.name.fl_str_mv |
Repositório Institucional da Universidade Federal Fluminense (RIUFF) - Universidade Federal Fluminense (UFF) |
repository.mail.fl_str_mv |
riuff@id.uff.br |
_version_ |
1807838828059164672 |