<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="xsl/oai2.xslt"?>
<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-09-21T06:03:10Z</responseDate>
  <request verb="GetRecord" metadataPrefix="xMetaDissPlus" identifier="oai:kobv.de-opus4-uni-passau:2090">https://opus4.kobv.de/opus4-uni-passau/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:kobv.de-opus4-uni-passau:2090</identifier>
        <datestamp>2026-06-22</datestamp>
        <setSpec>bibliography:false</setSpec>
        <setSpec>doc-type:PhDThesis</setSpec>
        <setSpec>open_access</setSpec>
        <setSpec>ddc</setSpec>
        <setSpec>ddc:006</setSpec>
        <setSpec>ddc:330</setSpec>
        <setSpec>ddc:519</setSpec>
        <setSpec>ddc:604</setSpec>
      </header>
      <metadata>
        <xMetaDiss:xMetaDiss xmlns:xMetaDiss="http://www.d-nb.de/standards/xmetadissplus/" xmlns:cc="http://www.d-nb.de/standards/cc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcmitype="http://purl.org/dc/dcmitype/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:pc="http://www.d-nb.de/standards/pc/" xmlns:urn="http://www.d-nb.de/standards/urn/" xmlns:hdl="http://www.d-nb.de/standards/hdl/" xmlns:doi="http://www.d-nb.de/standards/doi/" xmlns:thesis="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:ddb="http://www.d-nb.de/standards/ddb/" xmlns:dini="http://www.d-nb.de/standards/xmetadissplus/type/" xmlns="http://www.d-nb.de/standards/subject/" xsi:schemaLocation="http://www.d-nb.de/standards/xmetadissplus/ https://d-nb.info/standards/schema/xmetadissplus.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
          <dc:title xsi:type="ddb:titleISO639-2" lang="eng">Studies of Complex Routing Problems with Synchronization and Stochastic Information</dc:title>
          <dc:creator xsi:type="pc:MetaPers">
            <pc:person>
              <ddb:ORCID>0009-0009-7975-2865</ddb:ORCID>
              <pc:name type="nameUsedByThePerson">
                <pc:foreName>Luis Aurelio</pc:foreName>
                <pc:surName>Rocha</pc:surName>
              </pc:name>
            </pc:person>
          </dc:creator>
          <dc:subject xsi:type="xMetaDiss:DDC-SG">006</dc:subject>
          <dc:subject xsi:type="xMetaDiss:DDC-SG">330</dc:subject>
          <dc:subject xsi:type="xMetaDiss:DDC-SG">519</dc:subject>
          <dc:subject xsi:type="xMetaDiss:DDC-SG">604</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">VRP</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">PDP</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">synchronization</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">uncertainty</dc:subject>
          <dc:subject xsi:type="xMetaDiss:noScheme">specimen collection</dc:subject>
          <dcterms:abstract xsi:type="ddb:contentISO639-2" ddb:type="noScheme" lang="eng">Routing problems typically assume deterministic parameters and independent vehicle operations. Many real-world logistics systems, however, involve synchronization requirements among resources and uncertainty in system parameters — challenges that are both practically relevant and theoretically difficult. This dissertation addresses both dimensions through a series of complementary contributions. &#13;
We begin with a literature review of specimen logistics, surveying strategic, tactical, and operational routing problems in laboratory supply chains. We then develop a two-index formulation for the specimen collection problem with synchronized multiple trips and one lab, which solves 55 out of 56 small instances where the state-of-the-art model finds none, proves optimality in up to 30% of larger instances, and outperforms the state-of-the-art ALNS in 8 out of 12 settings with an average gap of 1.12%. In the third chapter, we introduce a compact model for the pickup-and-delivery problem with transfers, strengthened by novel valid inequalities, and extended to a novel branch-and-cut approach, which outperforms existing methods by solving 68 of 90 large benchmark instances and, for the first time, solves instances with up to 50 requests. The fourth chapter addresses a truck-and-drone TSP under vehicle synchronization and edge-traversal uncertainty in disaster relief settings; we derive competitive ratios for common policies, validate them in simulation, and propose an improved hybrid policy exploiting uncertainty through strategic surveillance. Finally, we study a production routing problem with stochastic driver availability. Our new deterministic heterogeneous-vehicle reformulation (HetPRP) outperforms our customized Benders decomposition approach, achieving average optimality gaps of 0.11%–0.97% on benchmark instances with up to 50 retailers and nine periods. We further quantify the value of stochastic solutions — up to 5.23% in non-urban settings — and show through a case study that integrating crowd-sourced drivers can yield cost savings of up to 21.71%.&#13;
Taken together, these contributions advance the state of the art in synchronized and stochastic routing, offering both theoretical guarantees and practically efficient solution methods.</dcterms:abstract>
          <dc:publisher xsi:type="cc:Publisher" type="dcterms:ISO3166">
            <cc:universityOrInstitution>
              <cc:name>Universität Passau</cc:name>
              <cc:place>Passau</cc:place>
            </cc:universityOrInstitution>
            <cc:address cc:Scheme="DIN5008">Innstrasse 29, 94032 Passau</cc:address>
          </dc:publisher>
          <dc:contributor xsi:type="pc:Contributor" type="dcterms:ISO3166" thesis:role="advisor">
            <pc:person>
              <ddb:ORCID>0000-0002-6069-9330</ddb:ORCID>
              <pc:name type="nameUsedByThePerson">
                <pc:foreName>Alena</pc:foreName>
                <pc:surName>Otto</pc:surName>
              </pc:name>
            </pc:person>
          </dc:contributor>
          <dc:contributor xsi:type="pc:Contributor" type="dcterms:ISO3166" thesis:role="advisor">
            <pc:person>
              <ddb:ORCID>0000-0002-1671-0344</ddb:ORCID>
              <pc:name type="nameUsedByThePerson">
                <pc:foreName>Frauke</pc:foreName>
                <pc:surName>Liers</pc:surName>
              </pc:name>
            </pc:person>
          </dc:contributor>
          <dcterms:dateAccepted xsi:type="dcterms:W3CDTF">2026-04-22</dcterms:dateAccepted>
          <dcterms:issued xsi:type="dcterms:W3CDTF">2026-06-22</dcterms:issued>
          <dc:type xsi:type="dini:PublType">PhDThesis</dc:type>
          <dc:type xsi:type="dcterms:DCMIType">Text</dc:type>
          <dc:identifier xsi:type="urn:nbn">urn:nbn:de:bvb:739-opus4-20906</dc:identifier>
          <dcterms:medium xsi:type="dcterms:IMT">application/pdf</dcterms:medium>
          <dc:language xsi:type="dcterms:ISO639-2">eng</dc:language>
          <dc:rights>Standardbedingung laut Einverständniserklärung</dc:rights>
          <thesis:degree>
            <thesis:level>thesis.doctoral</thesis:level>
            <thesis:grantor xsi:type="cc:Corporate">
              <cc:universityOrInstitution>
                <cc:name>Universität Passau</cc:name>
                <cc:place>Passau</cc:place>
                <cc:department>
                  <cc:name>Wirtschaftswissenschaftliche Fakultät</cc:name>
                </cc:department>
              </cc:universityOrInstitution>
            </thesis:grantor>
          </thesis:degree>
          <ddb:contact ddb:contactID="F6000-0384"/>
          <ddb:fileNumber>1</ddb:fileNumber>
          <ddb:fileProperties ddb:fileName="Rocha_Luis_A_Dissertation_ComplexRouting.pdf" ddb:fileSize="26274728" ddb:fileID="file2090-0"/>
          <ddb:transfer ddb:type="dcterms:URI">https://opus4.kobv.de/opus4-uni-passau/oai/container/index/docId/2090</ddb:transfer>
          <ddb:identifier ddb:type="URL">https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/2090</ddb:identifier>
          <ddb:rights ddb:kind="free"/>
        </xMetaDiss:xMetaDiss>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
