Solving the dial-a-ride problem using iterated local serach

Detalhes bibliográficos
Autor(a) principal: Medeiros, Pedro Gabriel de Souza Vereza
Data de Publicação: 2016
Tipo de documento: Trabalho de conclusão de curso
Idioma: eng
Título da fonte: Repositório Institucional da UFRGS
Texto Completo: http://hdl.handle.net/10183/151017
Resumo: The Dial-a-Ride Problem (DARP) is an NP-hard combinatorial problem. The DARP is a variant of the Vehicle Routing Problem (VRP), focusing in the transportation of passengers. It consists in, given a set of requests for pick-up and delivery requested by users and a set of homogeneous vehicle, optimize the assignment of requests to vehicles in order to serve all requests, providing optimal routes and respecting problem constraints such as route duration, vehicle capacity, passenger ride time, departure and arrival time windows. This work presents an approach to DARP using the Iterated Local Search (ILS) metaheuristic, which has been successfully applied in solving other variants of the VRP. The goal of this work was to evaluate the suitability of ILS in the context of DARP. For that, a comparison between obtained results and the ones found in the literature was presented and indicated promising results.
id UFRGS-2_7a80eff6d2a59d12cabd032f74fa738e
oai_identifier_str oai:www.lume.ufrgs.br:10183/151017
network_acronym_str UFRGS-2
network_name_str Repositório Institucional da UFRGS
repository_id_str
spelling Medeiros, Pedro Gabriel de Souza VerezaBuriol, Luciana Salete2017-01-19T02:29:58Z2016http://hdl.handle.net/10183/151017001009869The Dial-a-Ride Problem (DARP) is an NP-hard combinatorial problem. The DARP is a variant of the Vehicle Routing Problem (VRP), focusing in the transportation of passengers. It consists in, given a set of requests for pick-up and delivery requested by users and a set of homogeneous vehicle, optimize the assignment of requests to vehicles in order to serve all requests, providing optimal routes and respecting problem constraints such as route duration, vehicle capacity, passenger ride time, departure and arrival time windows. This work presents an approach to DARP using the Iterated Local Search (ILS) metaheuristic, which has been successfully applied in solving other variants of the VRP. The goal of this work was to evaluate the suitability of ILS in the context of DARP. For that, a comparison between obtained results and the ones found in the literature was presented and indicated promising results.O Dial-a-Ride Problem (DARP) é um problema combinacional NP-difícil. O DARP é uma variante do Vehicle Routing Problem (VRP), focando no transporte de passageiros. O problema consiste em, dado um conjunto de requisições de coleta e entrega feitas por usuários e um conjunto de veículos idênticos, otimizar a atribuição de requisições a veículos com objetivo de atender todas as requisições, produzindo rotas ótimas e respeitando limitações impostas pelo problema, como capacidade máxima dos veículos, tempo máximo de rota de um passageiro e janelas de tempo no embarque e desembarque. Este trabalho apresenta uma abordagem para o DARP utilizando a metaheurística Iterated Local Search (ILS), que tem sido aplicada com sucesso na resolução de outras variantes do VRP. O objetivo desse trabalho foi avaliar a adequação do ILS ao contexto do DARP. Para isso, comparações entre resultados obtidos e resultados disponíveis na literatura foram realizadas e indicaram resultados promissores.application/pdfengInformatica : TransportesTransporte de passageiroMetaheuristicasDial-a-ride problemIterated local searchVehicle routingSolving the dial-a-ride problem using iterated local serachinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bachelorThesisUniversidade Federal do Rio Grande do SulInstituto de InformáticaPorto Alegre, BR-RS2016Ciência da Computação: Ênfase em Ciência da Computação: Bachareladograduaçãoinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSORIGINAL001009869.pdf001009869.pdfTexto completo (inglês)application/pdf316794http://www.lume.ufrgs.br/bitstream/10183/151017/1/001009869.pdf8d932a79cd72f7188ced8b0661eaba95MD51TEXT001009869.pdf.txt001009869.pdf.txtExtracted Texttext/plain64056http://www.lume.ufrgs.br/bitstream/10183/151017/2/001009869.pdf.txtbc460730112f136e196ed5ebddcc901fMD52THUMBNAIL001009869.pdf.jpg001009869.pdf.jpgGenerated Thumbnailimage/jpeg1068http://www.lume.ufrgs.br/bitstream/10183/151017/3/001009869.pdf.jpg0c39b5b861c6a011af3f72295f715b10MD5310183/1510172024-10-26 06:57:17.259412oai:www.lume.ufrgs.br:10183/151017Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2024-10-26T09:57:17Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false
dc.title.pt_BR.fl_str_mv Solving the dial-a-ride problem using iterated local serach
title Solving the dial-a-ride problem using iterated local serach
spellingShingle Solving the dial-a-ride problem using iterated local serach
Medeiros, Pedro Gabriel de Souza Vereza
Informatica : Transportes
Transporte de passageiro
Metaheuristicas
Dial-a-ride problem
Iterated local search
Vehicle routing
title_short Solving the dial-a-ride problem using iterated local serach
title_full Solving the dial-a-ride problem using iterated local serach
title_fullStr Solving the dial-a-ride problem using iterated local serach
title_full_unstemmed Solving the dial-a-ride problem using iterated local serach
title_sort Solving the dial-a-ride problem using iterated local serach
author Medeiros, Pedro Gabriel de Souza Vereza
author_facet Medeiros, Pedro Gabriel de Souza Vereza
author_role author
dc.contributor.author.fl_str_mv Medeiros, Pedro Gabriel de Souza Vereza
dc.contributor.advisor1.fl_str_mv Buriol, Luciana Salete
contributor_str_mv Buriol, Luciana Salete
dc.subject.por.fl_str_mv Informatica : Transportes
Transporte de passageiro
Metaheuristicas
topic Informatica : Transportes
Transporte de passageiro
Metaheuristicas
Dial-a-ride problem
Iterated local search
Vehicle routing
dc.subject.eng.fl_str_mv Dial-a-ride problem
Iterated local search
Vehicle routing
description The Dial-a-Ride Problem (DARP) is an NP-hard combinatorial problem. The DARP is a variant of the Vehicle Routing Problem (VRP), focusing in the transportation of passengers. It consists in, given a set of requests for pick-up and delivery requested by users and a set of homogeneous vehicle, optimize the assignment of requests to vehicles in order to serve all requests, providing optimal routes and respecting problem constraints such as route duration, vehicle capacity, passenger ride time, departure and arrival time windows. This work presents an approach to DARP using the Iterated Local Search (ILS) metaheuristic, which has been successfully applied in solving other variants of the VRP. The goal of this work was to evaluate the suitability of ILS in the context of DARP. For that, a comparison between obtained results and the ones found in the literature was presented and indicated promising results.
publishDate 2016
dc.date.issued.fl_str_mv 2016
dc.date.accessioned.fl_str_mv 2017-01-19T02:29:58Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/bachelorThesis
format bachelorThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10183/151017
dc.identifier.nrb.pt_BR.fl_str_mv 001009869
url http://hdl.handle.net/10183/151017
identifier_str_mv 001009869
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.source.none.fl_str_mv reponame:Repositório Institucional da UFRGS
instname:Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
instname_str Universidade Federal do Rio Grande do Sul (UFRGS)
instacron_str UFRGS
institution UFRGS
reponame_str Repositório Institucional da UFRGS
collection Repositório Institucional da UFRGS
bitstream.url.fl_str_mv http://www.lume.ufrgs.br/bitstream/10183/151017/1/001009869.pdf
http://www.lume.ufrgs.br/bitstream/10183/151017/2/001009869.pdf.txt
http://www.lume.ufrgs.br/bitstream/10183/151017/3/001009869.pdf.jpg
bitstream.checksum.fl_str_mv 8d932a79cd72f7188ced8b0661eaba95
bc460730112f136e196ed5ebddcc901f
0c39b5b861c6a011af3f72295f715b10
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)
repository.mail.fl_str_mv
_version_ 1815447186692898816

Registros relacionados