Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos

Detalhes bibliográficos
Ano de defesa: 2013
Autor(a) principal: Junqueira, Leonardo
Orientador(a): Morabito Neto, Reinaldo lattes
Banca de defesa: Não Informado pela instituição
Tipo de documento: Tese
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de São Carlos
Programa de Pós-Graduação: Programa de Pós-Graduação em Engenharia de Produção - PPGEP
Departamento: Não Informado pela instituição
País: BR
Palavras-chave em Português:
Palavras-chave em Inglês:
Área do conhecimento CNPq:
Link de acesso: https://repositorio.ufscar.br/handle/ufscar/3424
Resumo: The object of this study are combined problems of the Vehicle Routing Problem and the Container Loading Problem, recently addressed as Integrated Vehicle Routing and Loading Problems. In these problems, the objective is to optimize simultaneously the planning of the vehicles routes and the arrangement of the cargo inside them, while considering a series of practical constraints from both vehicle routing and container loading. The objectives of this study are: (i) to study the integration between the Vehicle Routing Problem and the Container Loading Problem; (ii) to develop mathematical programming models to represent Integrated Vehicle Routing and Loading Problems; (iii) to develop and implement heuristics and metaheuristics to solve some of these problems; (iv) to analyze and compare the performance of the proposed models, by means of modeling languages and optimization solvers, as well as the heuristic methods, when solving instances from the literature and real-world situations. Besides being hard and relatively less studied problems, the main reason for this study is that with effective solution methods for optimizing the vehicle routing and the cargo loading, operational and tactical decisions could be made with more reliability, accuracy, quickness and with less uncertainty in real situations, besides of an improved use of the staff tasked to load and unload the cargo. On the other hand, these methods can also be usefull to reduce fixed and variable costs in a company that might use them. Computational experiments with some of the proposed models were performed with an optimization software and randomly generated instances. The results show that the models are consistent and properly represent the practical situations treated, although this approach (in its current version) is limited to solve to optimality only problems of moderate size, that is, situations with few customers, few vehicles, and mainly with a relatively reduced number of possible positions to load the boxes. This has motivated the development of heuristic and metaheuristic methods to solve more realistic vehicle routing and loading problems. The algorithms are based on the combination of classical heuristics from both the vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. Computational experiments were performed with these methods considering instances based on the vehicle routing literature and actual customers orders, as well as instances based on a real-world situation where the problem occurs.
id SCAR_d74b3ba776b47f7a24296100ce315fb5
oai_identifier_str oai:repositorio.ufscar.br:ufscar/3424
network_acronym_str SCAR
network_name_str Repositório Institucional da UFSCAR
repository_id_str
spelling Junqueira, LeonardoMorabito Neto, Reinaldohttp://genos.cnpq.br:12010/dwlattes/owa/prc_imp_cv_int?f_cod=K4723157U6http://lattes.cnpq.br/21796576095961942826dd45-b2e1-4f3a-9341-ae1fbf4b46a12016-06-02T19:50:20Z2013-06-142016-06-02T19:50:20Z2013-05-17JUNQUEIRA, Leonardo. Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos. 2013. 228 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2013.https://repositorio.ufscar.br/handle/ufscar/3424The object of this study are combined problems of the Vehicle Routing Problem and the Container Loading Problem, recently addressed as Integrated Vehicle Routing and Loading Problems. In these problems, the objective is to optimize simultaneously the planning of the vehicles routes and the arrangement of the cargo inside them, while considering a series of practical constraints from both vehicle routing and container loading. The objectives of this study are: (i) to study the integration between the Vehicle Routing Problem and the Container Loading Problem; (ii) to develop mathematical programming models to represent Integrated Vehicle Routing and Loading Problems; (iii) to develop and implement heuristics and metaheuristics to solve some of these problems; (iv) to analyze and compare the performance of the proposed models, by means of modeling languages and optimization solvers, as well as the heuristic methods, when solving instances from the literature and real-world situations. Besides being hard and relatively less studied problems, the main reason for this study is that with effective solution methods for optimizing the vehicle routing and the cargo loading, operational and tactical decisions could be made with more reliability, accuracy, quickness and with less uncertainty in real situations, besides of an improved use of the staff tasked to load and unload the cargo. On the other hand, these methods can also be usefull to reduce fixed and variable costs in a company that might use them. Computational experiments with some of the proposed models were performed with an optimization software and randomly generated instances. The results show that the models are consistent and properly represent the practical situations treated, although this approach (in its current version) is limited to solve to optimality only problems of moderate size, that is, situations with few customers, few vehicles, and mainly with a relatively reduced number of possible positions to load the boxes. This has motivated the development of heuristic and metaheuristic methods to solve more realistic vehicle routing and loading problems. The algorithms are based on the combination of classical heuristics from both the vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. Computational experiments were performed with these methods considering instances based on the vehicle routing literature and actual customers orders, as well as instances based on a real-world situation where the problem occurs.O objeto de estudo deste trabalho são problemas combinados do Problema de Roteamento de Veículos com o Problema de Carregamento de Contêineres, tratados mais recentemente na literatura como Problemas Integrados de Roteamento e Carregamento de Veículos. Nestes problemas, genericamente, busca-se otimizar simultaneamente o planejamento dos roteiros dos veículos e o arranjo da carga dentro dos mesmos, respeitando-se uma série de considerações práticas que advêm tanto do Problema de Roteamento de Veículos como do Problema de Carregamento de Contêineres. Os objetivos deste trabalho são: (i) estudar a integração do Problema de Roteamento de Veículos com o Problema de Carregamento de Contêineres; (ii) desenvolver modelos de programação matemática para representar Problemas Integrados de Roteamento e Carregamento de Veículos; (iii) desenvolver e implementar métodos heurísticos e meta-heurísticos para resolver alguns destes problemas; (iv) analisar e comparar o desempenho da solução dos modelos, via linguagens de modelagem e aplicativos de otimização, e dos métodos heurísticos desenvolvidos ao resolver exemplos baseados na literatura e em situações reais em que este problema ocorre. Além de serem problemas difíceis e relativamente pouco estudados, a principal justificativa para o estudo destes problemas é que, com métodos de solução eficazes para a otimização do roteamento dos veículos e do carregamento das cargas, decisões operacionais e táticas podem ser tomadas com maior segurança, acurácia, rapidez e menor incerteza em situações reais, além de possibilitar um melhor desempenho do pessoal encarregado da montagem e descarregamento da carga. Por outro lado, estes métodos também podem ser úteis na redução de custos fixos e variáveis de uma empresa que venha a utilizá-los. Experimentos computacionais com alguns dos modelos propostos foram realizados utilizando um aplicativo de otimização e aplicados a exemplos gerados aleatoriamente. Estes resultados mostram que os modelos são coerentes e representam adequadamente as situações tratadas, embora esta abordagem (na sua versão atual) esteja limitada a resolver otimamente apenas problemas de tamanho bem moderado, isto é, em que haja poucos clientes, poucos veículos, e que o número de possíveis posições para se arranjar as caixas dentro de cada veículo seja relativamente pequeno. Isso motivou o desenvolvimento de métodos heurísticos e meta-heurísticos para resolver problemas mais realistas de roteamento e carregamento de veículos. Os algoritmos são baseados na combinação de heurísticas clássicas das literaturas de Roteamento de Veículos e de Carregamento de Contêineres, bem como em duas estratégias meta-heurísticas, e no uso delas em procedimentos mais elaborados. Embora não haja garantias de que as soluções obtidas para os respectivos problemas sejam ótimas, tratam-se de heurísticas relativamente simples, suficientemente rápidas para resolver problemas reais, razoavelmente flexíveis para incorporar aspectos práticos, e que normalmente garantem soluções relativamente boas em tempos computacionais aceitáveis na prática. Experimentos computacionais foram realizados com estes métodos considerando exemplos baseados na literatura de Roteamento de Veículos e em pedidos reais de cargas, bem como exemplos baseados em um caso real em que o problema ocorre.Financiadora de Estudos e Projetosapplication/pdfporUniversidade Federal de São CarlosPrograma de Pós-Graduação em Engenharia de Produção - PPGEPUFSCarBRPesquisa operacionalOtimização combinatóriaModelagem matemáticaMétodos heurísticosRoteamento de veículosCarregamento de contêineresProblemas integrados de roteamento e carregamento de veículosVehicle routingContainer loadingIntegrated vehicle routing and loading problemsCombinatorial optimizationHeuristic methodsENGENHARIAS::ENGENHARIA DE PRODUCAOModelos e algoritmos para problemas integrados de roteamento e carregamento de veículosinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesis-1-1ab73fe2d-ae49-4b7d-915b-b256b3c2d946info:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINAL5182.pdfapplication/pdf6075915https://repositorio.ufscar.br/bitstream/ufscar/3424/1/5182.pdf91596b4ab6b9108e05799c5f3c87831dMD51TEXT5182.pdf.txt5182.pdf.txtExtracted texttext/plain0https://repositorio.ufscar.br/bitstream/ufscar/3424/2/5182.pdf.txtd41d8cd98f00b204e9800998ecf8427eMD52THUMBNAIL5182.pdf.jpg5182.pdf.jpgIM Thumbnailimage/jpeg6362https://repositorio.ufscar.br/bitstream/ufscar/3424/3/5182.pdf.jpg2369d28f09474411584e80b41225fc50MD53ufscar/34242023-09-18 18:31:32.835oai:repositorio.ufscar.br:ufscar/3424Repositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestopendoar:43222023-09-18T18:31:32Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)false
dc.title.por.fl_str_mv Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
title Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
spellingShingle Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
Junqueira, Leonardo
Pesquisa operacional
Otimização combinatória
Modelagem matemática
Métodos heurísticos
Roteamento de veículos
Carregamento de contêineres
Problemas integrados de roteamento e carregamento de veículos
Vehicle routing
Container loading
Integrated vehicle routing and loading problems
Combinatorial optimization
Heuristic methods
ENGENHARIAS::ENGENHARIA DE PRODUCAO
title_short Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
title_full Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
title_fullStr Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
title_full_unstemmed Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
title_sort Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos
author Junqueira, Leonardo
author_facet Junqueira, Leonardo
author_role author
dc.contributor.authorlattes.por.fl_str_mv http://lattes.cnpq.br/2179657609596194
dc.contributor.author.fl_str_mv Junqueira, Leonardo
dc.contributor.advisor1.fl_str_mv Morabito Neto, Reinaldo
dc.contributor.advisor1Lattes.fl_str_mv http://genos.cnpq.br:12010/dwlattes/owa/prc_imp_cv_int?f_cod=K4723157U6
dc.contributor.authorID.fl_str_mv 2826dd45-b2e1-4f3a-9341-ae1fbf4b46a1
contributor_str_mv Morabito Neto, Reinaldo
dc.subject.por.fl_str_mv Pesquisa operacional
Otimização combinatória
Modelagem matemática
Métodos heurísticos
Roteamento de veículos
Carregamento de contêineres
Problemas integrados de roteamento e carregamento de veículos
topic Pesquisa operacional
Otimização combinatória
Modelagem matemática
Métodos heurísticos
Roteamento de veículos
Carregamento de contêineres
Problemas integrados de roteamento e carregamento de veículos
Vehicle routing
Container loading
Integrated vehicle routing and loading problems
Combinatorial optimization
Heuristic methods
ENGENHARIAS::ENGENHARIA DE PRODUCAO
dc.subject.eng.fl_str_mv Vehicle routing
Container loading
Integrated vehicle routing and loading problems
Combinatorial optimization
Heuristic methods
dc.subject.cnpq.fl_str_mv ENGENHARIAS::ENGENHARIA DE PRODUCAO
description The object of this study are combined problems of the Vehicle Routing Problem and the Container Loading Problem, recently addressed as Integrated Vehicle Routing and Loading Problems. In these problems, the objective is to optimize simultaneously the planning of the vehicles routes and the arrangement of the cargo inside them, while considering a series of practical constraints from both vehicle routing and container loading. The objectives of this study are: (i) to study the integration between the Vehicle Routing Problem and the Container Loading Problem; (ii) to develop mathematical programming models to represent Integrated Vehicle Routing and Loading Problems; (iii) to develop and implement heuristics and metaheuristics to solve some of these problems; (iv) to analyze and compare the performance of the proposed models, by means of modeling languages and optimization solvers, as well as the heuristic methods, when solving instances from the literature and real-world situations. Besides being hard and relatively less studied problems, the main reason for this study is that with effective solution methods for optimizing the vehicle routing and the cargo loading, operational and tactical decisions could be made with more reliability, accuracy, quickness and with less uncertainty in real situations, besides of an improved use of the staff tasked to load and unload the cargo. On the other hand, these methods can also be usefull to reduce fixed and variable costs in a company that might use them. Computational experiments with some of the proposed models were performed with an optimization software and randomly generated instances. The results show that the models are consistent and properly represent the practical situations treated, although this approach (in its current version) is limited to solve to optimality only problems of moderate size, that is, situations with few customers, few vehicles, and mainly with a relatively reduced number of possible positions to load the boxes. This has motivated the development of heuristic and metaheuristic methods to solve more realistic vehicle routing and loading problems. The algorithms are based on the combination of classical heuristics from both the vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. Computational experiments were performed with these methods considering instances based on the vehicle routing literature and actual customers orders, as well as instances based on a real-world situation where the problem occurs.
publishDate 2013
dc.date.available.fl_str_mv 2013-06-14
2016-06-02T19:50:20Z
dc.date.issued.fl_str_mv 2013-05-17
dc.date.accessioned.fl_str_mv 2016-06-02T19:50:20Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv JUNQUEIRA, Leonardo. Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos. 2013. 228 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2013.
dc.identifier.uri.fl_str_mv https://repositorio.ufscar.br/handle/ufscar/3424
identifier_str_mv JUNQUEIRA, Leonardo. Modelos e algoritmos para problemas integrados de roteamento e carregamento de veículos. 2013. 228 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2013.
url https://repositorio.ufscar.br/handle/ufscar/3424
dc.language.iso.fl_str_mv por
language por
dc.relation.confidence.fl_str_mv -1
-1
dc.relation.authority.fl_str_mv ab73fe2d-ae49-4b7d-915b-b256b3c2d946
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Federal de São Carlos
dc.publisher.program.fl_str_mv Programa de Pós-Graduação em Engenharia de Produção - PPGEP
dc.publisher.initials.fl_str_mv UFSCar
dc.publisher.country.fl_str_mv BR
publisher.none.fl_str_mv Universidade Federal de São Carlos
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFSCAR
instname:Universidade Federal de São Carlos (UFSCAR)
instacron:UFSCAR
instname_str Universidade Federal de São Carlos (UFSCAR)
instacron_str UFSCAR
institution UFSCAR
reponame_str Repositório Institucional da UFSCAR
collection Repositório Institucional da UFSCAR
bitstream.url.fl_str_mv https://repositorio.ufscar.br/bitstream/ufscar/3424/1/5182.pdf
https://repositorio.ufscar.br/bitstream/ufscar/3424/2/5182.pdf.txt
https://repositorio.ufscar.br/bitstream/ufscar/3424/3/5182.pdf.jpg
bitstream.checksum.fl_str_mv 91596b4ab6b9108e05799c5f3c87831d
d41d8cd98f00b204e9800998ecf8427e
2369d28f09474411584e80b41225fc50
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)
repository.mail.fl_str_mv
_version_ 1802136483018047488