<?xml version="1.0" encoding="UTF-8"?>
<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-07-20T05:25:12Z</responseDate>
  <request identifier="2187" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2187</identifier>
        <datestamp>2024-03-06T11:08:48Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals</dc:title>
          <dc:creator>Naujoks, Boris</dc:creator>
          <dc:creator>Chmielewski, Annette</dc:creator>
          <dc:subject>Door Assignment Problem</dc:subject>
          <dc:subject>Column Generation Approach</dc:subject>
          <dc:subject>Multi-objective evolutionary algorithm approach</dc:subject>
          <dc:description>The work at hand yields two different ways to address the assignment of inbound and outbound doors in less-than-truckload terminals. The considered optimization methods stem from two different scientific fields, which makes the comparison of the techniques a very interesting topic. The first solution approach origins from the field of discrete mathematics. For this purpose, the logistical optimization task is modeled as a time-discrete multi-commodity flow problem with side constraints. Based on this model, a decomposition approach and a modified column generation approach are developed.  The second considered optimization method is an evolutionary multi-objective optimization algorithm (EMOA). This approach is able to handle different optimization goals in parallel. Both algorithms are applied to ten test scenarios yielding different numbers of tours, doors, loading areas, and affected relations.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Boris Naujoks and Annette Chmielewski</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09261.7</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21870</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.7</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
