<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-05T13:10:34Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/43817" metadataPrefix="uketd_dc">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/43817</identifier><datestamp>2021-11-30T10:08:29Z</datestamp><setSpec>com_10324_38</setSpec><setSpec>col_10324_852</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
<dc:title>Métodos escalables de resolución para el Dial-a-Ride Problem (DARP)</dc:title>
<dc:creator>García Prado, Sergio</dc:creator>
<uketdterms:advisor>Sáez Aguado, Jesús</uketdterms:advisor>
<uketdterms:advisor>Tapia García, Jesús Alberto</uketdterms:advisor>
<dcterms:abstract>En este documento se lleva a cabo un estudio acerca del problema Dial-a-Ride, sobre el cual es analizado en detalle desde una perspectiva formal,utilizando como herramienta de apoyo su formulación mediante el paradigma de Programación Lineal Mixta y Entera (MILP), a través de la cual se discutesu relación con otros Problemas de Rutas de Vehículos (VRP). Además, se lleva a cabo una descripción sobre los métodos de resolución mas popularespara resolver el problema Dial-a-Ride, partiendo por los Métodos Exactos para posteriormente enfocarse en aquellos basados en (Meta-)Heurísticas.Finalmente, se presenta la versión inicial de la biblioteca jinete como suite de métodos de resolución del problema, cuya implementación se ha llevado acabo como tarea adicional de este trabajo.</dcterms:abstract>
<dcterms:abstract>In this document, a study about the Dial-a-Ride problem is carried out, on which it is analyzed in&#xd;
detail from a formal perspective, using its formulation using the Mixed Integer Linear Programming&#xd;
(MILP) paradigm, through which its relationship with other Vehicle Route Problems (VRP) is&#xd;
discussed. In addition, a description on the most popular resolution methods to solve the Diala-&#xd;
Ride problem is carried out, starting with the Exact Methods to later focus on those based on&#xd;
(Meta-)Heuristics. Finally, an initial version of the jinete library is presented as a suite of methods&#xd;
for solving the problem, the implementation of which has been carried out as an additional task&#xd;
of this work.</dcterms:abstract>
<dcterms:issued>2020</dcterms:issued>
<dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
<dc:language xsi:type="dcterms:ISO639-2">spa</dc:language>
<dcterms:isReferencedBy>http://uvadoc.uva.es/handle/10324/43817</dcterms:isReferencedBy>
<dcterms:license>https://uvadoc.uva.es/bitstream/10324/43817/3/license.txt</dcterms:license>
<uketdterms:checksum xsi:type="uketdterms:MD5">017313583e37a1e4d1253e1ef6c66c6c</uketdterms:checksum>
<dc:identifier xsi:type="dcterms:URI">https://uvadoc.uva.es/bitstream/10324/43817/1/TFG-G4609.pdf</dc:identifier>
<uketdterms:checksum xsi:type="uketdterms:MD5">ad94e7c2605bb93d7bc40cd531b1fb82</uketdterms:checksum>
<dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</dc:rights>
</uketd_dc:uketddc></metadata></record></GetRecord></OAI-PMH>