<?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-22T12:14:10Z</responseDate>
  <request identifier="685" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:685</identifier>
        <datestamp>2024-03-06T10:28:24Z</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>Freight Service Design for the Italian Railways Company</dc:title>
          <dc:creator>Campetella, Marco</dc:creator>
          <dc:creator>Lulli, Guglielmo</dc:creator>
          <dc:creator>Pietropaoli, Ugo</dc:creator>
          <dc:creator>Ricciardi, Nicoletta</dc:creator>
          <dc:subject>Railways transportation</dc:subject>
          <dc:subject>service network design</dc:subject>
          <dc:subject>tabu search</dc:subject>
          <dc:description>In this paper, we present a mathematical model to design&#13;
the service network, that is the set of origin-destination&#13;
connections. The resulting model considers both full and empty&#13;
freight car movements, and takes into account handling costs. More&#13;
specifically, the model suggests the services to provide, as well&#13;
as the number of trains and the number and type of cars traveling&#13;
on each connection. Quality of service, which is measured as total&#13;
travel time, is established by minimizing the waiting time of cars&#13;
at intermediate stations.&#13;
&#13;
Our approach yields a multi-commodity network design problem with&#13;
concave arc cost functions. To solve this problem, we implement a&#13;
tabu search procedure which adopts ``perturbing'' mechanisms to&#13;
force the algorithm to explore a larger portion of the feasible&#13;
region. Computational results on realistic instances show a&#13;
significant improvement over current practice.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Marco Campetella and Guglielmo Lulli and Ugo Pietropaoli and Nicoletta Ricciardi</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)</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/OASIcs.ATMOS.2006.685</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6850</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.685</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
