The robust pickup and delivery problem with time windows
| Ano de defesa: | 2025 |
|---|---|
| Autor(a) principal: | |
| Orientador(a): | |
| Banca de defesa: | |
| Tipo de documento: | Dissertação |
| Tipo de acesso: | Acesso aberto |
| Idioma: | eng |
| Instituição de defesa: |
Universidade Federal de São Carlos
Câmpus 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: |
Não Informado pela instituição
|
| Palavras-chave em Português: | |
| Palavras-chave em Inglês: | |
| Área do conhecimento CNPq: | |
| Link de acesso: | https://hdl.handle.net/20.500.14289/21368 |
Resumo: | This study addresses the robust pickup and delivery problem with time windows (RPDPTW), in which uncertainty in demands and travel times is modelled using robust optimisation. The RPDPTW involves determining the least-cost routes to serve transportation requests from origins to destinations, while respecting vehicle capacity and time window constraints under all anticipated realisations of uncertain data. Two robust counterpart formulations are proposed. The first employs the linearisation of recursive equations to produce a compact formulation, suitable for implementation with general-purpose mixed-integer programming solvers. The second relies on a cutting-plane approach, incorporated into a tailored branch-and-cut (B&C) algorithm. Extensive computational experiments were conducted to evaluate the proposed methods across diverse instance configurations. While the compact formulation performed effectively in some cases, the B&C algorithm solved a larger number of instances to optimality and consistently provided high-quality solutions under uncertainty. Robust solutions significantly reduced the risk of infeasibility compared to deterministic solutions, with modest increases in routing costs. In addition, we provide managerial insights by analysing the results of Monte Carlo simulations across different instance characteristics. |
| id |
SCAR_8d40138611218d3edcfc9ec1551f7c3f |
|---|---|
| oai_identifier_str |
oai:repositorio.ufscar.br:20.500.14289/21368 |
| network_acronym_str |
SCAR |
| network_name_str |
Repositório Institucional da UFSCAR |
| repository_id_str |
|
| spelling |
Abreu, Alex Paranahyba deMunari, Pedrohttp://lattes.cnpq.br/1328868140869976Costa, Luciano Carlos Azevedo dahttp://lattes.cnpq.br/3954372189546017http://lattes.cnpq.br/0273240076049563https://orcid.org/0000-0002-8338-7452http://orcid.org/0000-0001-5929-593Xhttps://orcid.org/0000-0002-6324-65562025-02-13T18:23:18Z2025-01-29ABREU, Alex Paranahyba de. The robust pickup and delivery problem with time windows. 2025. Dissertação (Mestrado em Engenharia de Produção) – Universidade Federal de São Carlos, São Carlos, 2025. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/21368.https://hdl.handle.net/20.500.14289/21368This study addresses the robust pickup and delivery problem with time windows (RPDPTW), in which uncertainty in demands and travel times is modelled using robust optimisation. The RPDPTW involves determining the least-cost routes to serve transportation requests from origins to destinations, while respecting vehicle capacity and time window constraints under all anticipated realisations of uncertain data. Two robust counterpart formulations are proposed. The first employs the linearisation of recursive equations to produce a compact formulation, suitable for implementation with general-purpose mixed-integer programming solvers. The second relies on a cutting-plane approach, incorporated into a tailored branch-and-cut (B&C) algorithm. Extensive computational experiments were conducted to evaluate the proposed methods across diverse instance configurations. While the compact formulation performed effectively in some cases, the B&C algorithm solved a larger number of instances to optimality and consistently provided high-quality solutions under uncertainty. Robust solutions significantly reduced the risk of infeasibility compared to deterministic solutions, with modest increases in routing costs. In addition, we provide managerial insights by analysing the results of Monte Carlo simulations across different instance characteristics.Este estudo aborda o problema de coletas e entregas com janelas de tempo robusto (RPDPTW, do inglês robust pickup and delivery problem with time windows), no qual a incerteza nas demandas e nos tempos de viagem é modelada por meio da otimização robusta. O RPDPTW consiste em determinar rotas de menor custo para atender às requisições de transporte, levando cargas de origens a destinos, respeitando restrições de capacidade de veículos e de janelas de tempo considerando todas realizações antecipadas dos dados incertos. Duas formulações robustas foram propostas. A primeira emprega a técnica de linearização de equações recursivas resultando em uma formulação compacta, adequada para ser implementada com resolvedores de programação inteira mista de propósito geral. A segunda baseia-se em uma abordagem de planos de corte, sendo incorporada a um algoritmo especializado do tipo branch-and-cut (B&C). Experimentos computacionais extensivos foram realizados para avaliar os métodos propostos em diversas configurações de instâncias. Embora a formulação compacta tenha se mostrado eficiente em alguns casos, o algoritmo B&C solucionou um maior número de instâncias até a otimalidade e forneceu, de forma consistente, soluções de alta qualidade sob incerteza. As soluções robustas obtidas com os métodos reduziram significativamente o risco de infactibilidade em comparação com soluções determinísticas, com aumentos modestos nos custos de transporte. Além disso, foram fornecidos insights gerenciais analisando os resultados das simulações de Monte Carlo em diferentes características de instância.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Processo nº 2023/08678-8, Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Processo nº 2022/10993-6, Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior – Brasil (CAPES) – Código de Financiamento 1engUniversidade Federal de São CarlosCâmpus São CarlosPrograma de Pós-Graduação em Engenharia de Produção - PPGEPUFSCarAttribution-NonCommercial-NoDerivs 3.0 Brazilhttp://creativecommons.org/licenses/by-nc-nd/3.0/br/info:eu-repo/semantics/openAccessVehicle routingPickup and delivery problemTime windowsDemand uncertaintyTravel time uncertaintyENGENHARIAS::ENGENHARIA DE PRODUCAO::PESQUISA OPERACIONALRoteamento de veículosRroblema de coletas e entregasJanelas de tempoDemanda incertaTempo de viagem incertoThe robust pickup and delivery problem with time windowsO problema de coletas e entregas com janelas de tempo robustoinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINALFinal Dissertation Alex Abreu (UFSCar).pdfFinal Dissertation Alex Abreu (UFSCar).pdfapplication/pdf839612https://repositorio.ufscar.br/bitstreams/88c56144-c47c-4abe-870c-67392f46a524/download1bb4e4a438b5b0c15f0f1f1b72aafdcaMD51trueAnonymousREADTEXTFinal Dissertation Alex Abreu (UFSCar).pdf.txtFinal Dissertation Alex Abreu (UFSCar).pdf.txtExtracted texttext/plain102001https://repositorio.ufscar.br/bitstreams/6e0b544c-9073-4fa6-bd84-687565f7f8c8/download3281df9809b12e25c4f8338851d996d5MD53falseAnonymousREADTHUMBNAILFinal Dissertation Alex Abreu (UFSCar).pdf.jpgFinal Dissertation Alex Abreu (UFSCar).pdf.jpgGenerated Thumbnailimage/jpeg3754https://repositorio.ufscar.br/bitstreams/37153064-c6ea-4a6f-b786-8f0c8b7616d8/download06ed0b4377f51e4668b05b01db6654feMD54falseAnonymousREADCC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8905https://repositorio.ufscar.br/bitstreams/33e70a58-940c-40ca-8c32-42ac8d96181b/download57e258e544f104f04afb1d5e5b4e53c0MD52falseAnonymousREAD20.500.14289/213682025-02-14 00:20:11.407http://creativecommons.org/licenses/by-nc-nd/3.0/br/Attribution-NonCommercial-NoDerivs 3.0 Brazilopen.accessoai:repositorio.ufscar.br:20.500.14289/21368https://repositorio.ufscar.brRepositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestrepositorio.sibi@ufscar.bropendoar:43222025-02-14T03:20:11Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)false |
| dc.title.eng.fl_str_mv |
The robust pickup and delivery problem with time windows |
| dc.title.alternative.none.fl_str_mv |
O problema de coletas e entregas com janelas de tempo robusto |
| title |
The robust pickup and delivery problem with time windows |
| spellingShingle |
The robust pickup and delivery problem with time windows Abreu, Alex Paranahyba de Vehicle routing Pickup and delivery problem Time windows Demand uncertainty Travel time uncertainty ENGENHARIAS::ENGENHARIA DE PRODUCAO::PESQUISA OPERACIONAL Roteamento de veículos Rroblema de coletas e entregas Janelas de tempo Demanda incerta Tempo de viagem incerto |
| title_short |
The robust pickup and delivery problem with time windows |
| title_full |
The robust pickup and delivery problem with time windows |
| title_fullStr |
The robust pickup and delivery problem with time windows |
| title_full_unstemmed |
The robust pickup and delivery problem with time windows |
| title_sort |
The robust pickup and delivery problem with time windows |
| author |
Abreu, Alex Paranahyba de |
| author_facet |
Abreu, Alex Paranahyba de |
| author_role |
author |
| dc.contributor.authorlattes.none.fl_str_mv |
http://lattes.cnpq.br/0273240076049563 |
| dc.contributor.authororcid.none.fl_str_mv |
https://orcid.org/0000-0002-8338-7452 |
| dc.contributor.advisor1orcid.none.fl_str_mv |
http://orcid.org/0000-0001-5929-593X |
| dc.contributor.advisor-co1orcid.none.fl_str_mv |
https://orcid.org/0000-0002-6324-6556 |
| dc.contributor.author.fl_str_mv |
Abreu, Alex Paranahyba de |
| dc.contributor.advisor1.fl_str_mv |
Munari, Pedro |
| dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/1328868140869976 |
| dc.contributor.advisor-co1.fl_str_mv |
Costa, Luciano Carlos Azevedo da |
| dc.contributor.advisor-co1Lattes.fl_str_mv |
http://lattes.cnpq.br/3954372189546017 |
| contributor_str_mv |
Munari, Pedro Costa, Luciano Carlos Azevedo da |
| dc.subject.eng.fl_str_mv |
Vehicle routing Pickup and delivery problem Time windows Demand uncertainty Travel time uncertainty |
| topic |
Vehicle routing Pickup and delivery problem Time windows Demand uncertainty Travel time uncertainty ENGENHARIAS::ENGENHARIA DE PRODUCAO::PESQUISA OPERACIONAL Roteamento de veículos Rroblema de coletas e entregas Janelas de tempo Demanda incerta Tempo de viagem incerto |
| dc.subject.cnpq.fl_str_mv |
ENGENHARIAS::ENGENHARIA DE PRODUCAO::PESQUISA OPERACIONAL |
| dc.subject.por.fl_str_mv |
Roteamento de veículos Rroblema de coletas e entregas Janelas de tempo Demanda incerta Tempo de viagem incerto |
| description |
This study addresses the robust pickup and delivery problem with time windows (RPDPTW), in which uncertainty in demands and travel times is modelled using robust optimisation. The RPDPTW involves determining the least-cost routes to serve transportation requests from origins to destinations, while respecting vehicle capacity and time window constraints under all anticipated realisations of uncertain data. Two robust counterpart formulations are proposed. The first employs the linearisation of recursive equations to produce a compact formulation, suitable for implementation with general-purpose mixed-integer programming solvers. The second relies on a cutting-plane approach, incorporated into a tailored branch-and-cut (B&C) algorithm. Extensive computational experiments were conducted to evaluate the proposed methods across diverse instance configurations. While the compact formulation performed effectively in some cases, the B&C algorithm solved a larger number of instances to optimality and consistently provided high-quality solutions under uncertainty. Robust solutions significantly reduced the risk of infeasibility compared to deterministic solutions, with modest increases in routing costs. In addition, we provide managerial insights by analysing the results of Monte Carlo simulations across different instance characteristics. |
| publishDate |
2025 |
| dc.date.accessioned.fl_str_mv |
2025-02-13T18:23:18Z |
| dc.date.issued.fl_str_mv |
2025-01-29 |
| 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.citation.fl_str_mv |
ABREU, Alex Paranahyba de. The robust pickup and delivery problem with time windows. 2025. Dissertação (Mestrado em Engenharia de Produção) – Universidade Federal de São Carlos, São Carlos, 2025. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/21368. |
| dc.identifier.uri.fl_str_mv |
https://hdl.handle.net/20.500.14289/21368 |
| identifier_str_mv |
ABREU, Alex Paranahyba de. The robust pickup and delivery problem with time windows. 2025. Dissertação (Mestrado em Engenharia de Produção) – Universidade Federal de São Carlos, São Carlos, 2025. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/21368. |
| url |
https://hdl.handle.net/20.500.14289/21368 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.rights.driver.fl_str_mv |
Attribution-NonCommercial-NoDerivs 3.0 Brazil http://creativecommons.org/licenses/by-nc-nd/3.0/br/ info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
Attribution-NonCommercial-NoDerivs 3.0 Brazil http://creativecommons.org/licenses/by-nc-nd/3.0/br/ |
| eu_rights_str_mv |
openAccess |
| dc.publisher.none.fl_str_mv |
Universidade Federal de São Carlos Câmpus 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 |
| publisher.none.fl_str_mv |
Universidade Federal de São Carlos Câmpus 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/bitstreams/88c56144-c47c-4abe-870c-67392f46a524/download https://repositorio.ufscar.br/bitstreams/6e0b544c-9073-4fa6-bd84-687565f7f8c8/download https://repositorio.ufscar.br/bitstreams/37153064-c6ea-4a6f-b786-8f0c8b7616d8/download https://repositorio.ufscar.br/bitstreams/33e70a58-940c-40ca-8c32-42ac8d96181b/download |
| bitstream.checksum.fl_str_mv |
1bb4e4a438b5b0c15f0f1f1b72aafdca 3281df9809b12e25c4f8338851d996d5 06ed0b4377f51e4668b05b01db6654fe 57e258e544f104f04afb1d5e5b4e53c0 |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 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 |
repositorio.sibi@ufscar.br |
| _version_ |
1851688916586856448 |