A clustering approach for vehicle routing problems with hard time windows

Detalhes bibliográficos
Autor(a) principal: Pugacs, Sergejs
Data de Publicação: 2014
Tipo de documento: Dissertação
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10362/13045
Resumo: Dissertação para obtenção do Grau de Mestre em Logica Computicional
id RCAP_ff22c1fb526f57edbd399e8577964958
oai_identifier_str oai:run.unl.pt:10362/13045
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A clustering approach for vehicle routing problems with hard time windowsDissertação para obtenção do Grau de Mestre em Logica ComputicionalThe Vehicle Routing Problem (VRP) is a well known combinatorial optimization problem and many studies have been dedicated to it over the years since solving the VRP optimally or near-optimally for very large size problems has many practical applications (e.g. in various logistics systems). Vehicle Routing Problem with hard TimeWindows (VRPTW) is probably the most studied variant of the VRP problem and the presence of time windows requires complex techniques to handle it. In fact, finding a feasible solution to the VRPTWwhen the number of vehicles is fixed is an NP-complete problem. However, VRPTW is well studied and many different approaches to solve it have been developed over the years. Due to the inherent complexity of the underlying problem VRPTW is NP-Hard. Therefore, optimally solving problems with no more than one hundred requests is considered intractably hard. For this reason the literature is full with inexact methods that use metaheuristics, local search and hybrid approaches which are capable of producing high quality solutions within practical time limits. In this work we are interested in applying clustering techniques to VRPTWproblem. The idea of clustering has been successfully applied to the basic VRP problem. However very little work has yet been done in using clustering in the VRPTW variant. We present a novel approach based on clustering, that any VRPTW solver can adapt, by running a preprocessing stage before attempting to solve the problem. Our proposed method, tested with a state of the art solver (Indigo), enables the solver to find solutions much faster (up to an order of magnitude speed-up). In general this comes with at slightly reduced solution quality, but in somes types of problems, Indigo is able to obtain better solutions than those obtained with no clustering.Faculdade de Ciencias e TecnologiaBarahona, PedroRUNPugacs, Sergejs2014-08-01T09:40:03Z20142014-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10362/13045enginfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T03:47:43Zoai:run.unl.pt:10362/13045Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:21:02.525900Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A clustering approach for vehicle routing problems with hard time windows
title A clustering approach for vehicle routing problems with hard time windows
spellingShingle A clustering approach for vehicle routing problems with hard time windows
Pugacs, Sergejs
title_short A clustering approach for vehicle routing problems with hard time windows
title_full A clustering approach for vehicle routing problems with hard time windows
title_fullStr A clustering approach for vehicle routing problems with hard time windows
title_full_unstemmed A clustering approach for vehicle routing problems with hard time windows
title_sort A clustering approach for vehicle routing problems with hard time windows
author Pugacs, Sergejs
author_facet Pugacs, Sergejs
author_role author
dc.contributor.none.fl_str_mv Barahona, Pedro
RUN
dc.contributor.author.fl_str_mv Pugacs, Sergejs
description Dissertação para obtenção do Grau de Mestre em Logica Computicional
publishDate 2014
dc.date.none.fl_str_mv 2014-08-01T09:40:03Z
2014
2014-01-01T00:00:00Z
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 http://hdl.handle.net/10362/13045
url http://hdl.handle.net/10362/13045
dc.language.iso.fl_str_mv eng
language eng
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 Faculdade de Ciencias e Tecnologia
publisher.none.fl_str_mv Faculdade de Ciencias e Tecnologia
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137851094335488

Registros relacionados