<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>22274</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1569</pageFirst>
    <pageLast>1583</pageLast>
    <pageNumber/>
    <edition/>
    <issue>8</issue>
    <volume>9</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2018-09-13</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The multiple traveling salesmen problem with moving targets</title>
    <parentTitle language="eng">Optimization Letters</parentTitle>
    <identifier type="doi">10.1007/s11590-014-0835-6</identifier>
    <identifier type="issn">1862-4472</identifier>
    <identifier type="issn">1862-4480</identifier>
    <enrichment key="BTU">nicht an der BTU erstellt / not created at BTU</enrichment>
    <author>
      <firstName>Anke</firstName>
      <lastName>Stieber</lastName>
    </author>
    <submitter>
      <firstName>Annette</firstName>
      <lastName>Fischer</lastName>
    </submitter>
    <author>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </author>
    <author>
      <firstName>Maria</firstName>
      <lastName>Epp</lastName>
    </author>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Knapp</lastName>
    </author>
    <author>
      <firstName>Hendrik</firstName>
      <lastName>Rothe</lastName>
    </author>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>25016</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>489</pageFirst>
    <pageLast>494</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_noref</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-01-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories</title>
    <abstract language="eng">We consider the multiple traveling salesmen problem with moving targets (MTSPMT), which is a generalization of the classical traveling salesman problem (TSP). Here the nodes (objects, targets) are not static, they are moving over time on trajectories. Moreover, each target has a visibility time window and it can be reached by a salesman only within that time window. The objective function is to minimize the total traveled distances of all salesmen. We recall the time-discrete model formulation from Stieber et al. [9]. This model is applicable to arbitrarily shaped trajectories. Thus, we generated non-linear trajectories based on polynomials, trigonometric functions and their combinations. Computational experiments are carried out with up to 16 trajectories and the results are compared to the ones obtained with linear trajectories.</abstract>
    <parentTitle language="deu">Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6-8, 2017</parentTitle>
    <identifier type="doi">10.1007/978-3-319-89920-6_65</identifier>
    <identifier type="isbn">978-3-319-89920-6</identifier>
    <identifier type="isbn">978-3-319-89919-0</identifier>
    <identifier type="issn">0721-5924</identifier>
    <identifier type="issn">2197-9294</identifier>
    <enrichment key="UBICOseries">Operations Research Proceedings book series</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </author>
    <submitter>
      <firstName>Annette</firstName>
      <lastName>Fischer</lastName>
    </submitter>
    <editor>
      <firstName>Natalia</firstName>
      <lastName>Kliewer</lastName>
    </editor>
    <author>
      <firstName>Anke</firstName>
      <lastName>Stieber</lastName>
    </author>
    <editor>
      <firstName>Jan Fabian</firstName>
      <lastName>Ehmke</lastName>
    </editor>
    <editor>
      <firstName>Ralf</firstName>
      <lastName>Borndörfer</lastName>
    </editor>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>25005</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>161</pageFirst>
    <pageLast>179</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-01-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Use of Optimization Tools for Routing in Rail Freight Transport</title>
    <parentTitle language="eng">Handbook of Optimization in the Railway Industry</parentTitle>
    <identifier type="doi">10.1007/978-3-319-72153-8_8</identifier>
    <identifier type="isbn">978-3-319-72152-1</identifier>
    <identifier type="isbn">978-3-319-72153-8</identifier>
    <identifier type="issn">0884-8289</identifier>
    <identifier type="issn">2214-7934</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="UBICOseries">International Series in Operations Research &amp; Management Science book series ISOR ; volume 268</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </author>
    <editor>
      <firstName>Ralf</firstName>
      <lastName>Borndörfer</lastName>
    </editor>
    <submitter>
      <firstName>Annette</firstName>
      <lastName>Fischer</lastName>
    </submitter>
    <author>
      <firstName>Henning</firstName>
      <lastName>Homfeld</lastName>
    </author>
    <editor>
      <firstName>Torsten</firstName>
      <lastName>Klug</lastName>
    </editor>
    <author>
      <firstName>Marc</firstName>
      <lastName>Johann</lastName>
    </author>
    <editor>
      <firstName>Leonardo</firstName>
      <lastName>Lamorgese</lastName>
    </editor>
    <author>
      <firstName>Hanno</firstName>
      <lastName>Schülldorf</lastName>
    </author>
    <editor>
      <firstName>Carlo</firstName>
      <lastName>Mannino</lastName>
    </editor>
    <author>
      <firstName>Anke</firstName>
      <lastName>Stieber</lastName>
    </author>
    <editor>
      <firstName>Markus</firstName>
      <lastName>Reuther</lastName>
    </editor>
    <editor>
      <firstName>Thomas</firstName>
      <lastName>Schlechte</lastName>
    </editor>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>25011</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>20</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>report</type>
    <publisherName/>
    <publisherPlace>Cottbus</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-01-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets</title>
    <identifier type="doi">10.26127/BTUOpen-4824</identifier>
    <identifier type="issn">2627-6100</identifier>
    <identifier type="urn">urn:nbn:de:kobv:co1-opus4-48245</identifier>
    <enrichment key="UBICOseries">Cottbus Mathematical Preprints ; 4</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Anke</firstName>
      <lastName>Stieber</lastName>
    </author>
    <submitter>
      <firstName>Annette</firstName>
      <lastName>Fischer</lastName>
    </submitter>
    <editor>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </editor>
    <author>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </author>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>30172</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>991</pageFirst>
    <pageLast>1017</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>30</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-27</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets</title>
    <abstract language="deu">The multiple traveling salespersons problem with moving targets is a generalization of the classical traveling salespersons problem, where the targets (nodes or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salespersons so that each target is reached exactly once within its visibility time window and the sum of all traveled distances of all salespersons is minimal. We present different modeling formulations for this TSP variant. The time requirements are modeled differently in each approach. Our goal is to examine what formulation is most suitable in terms of runtime to solve the multiple traveling salespersons problem with moving targets with exact methods. Computational experiments are carried out on randomly generated test instances to compare the different modeling approaches. The results for large-scale instances show, that the best way to model time requirements is to directly insert them into a formulation with discrete time steps.</abstract>
    <parentTitle language="eng">Central European Journal of Operations Research</parentTitle>
    <identifier type="issn">1613-9178</identifier>
    <identifier type="issn">1435-246X</identifier>
    <identifier type="doi">10.1007/s10100-020-00712-7</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Publikationsweg">Open Access</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Anke</firstName>
      <lastName>Stieber</lastName>
    </author>
    <submitter>
      <firstName>Annette</firstName>
      <lastName>Fischer</lastName>
    </submitter>
    <author>
      <firstName>Armin</firstName>
      <lastName>Fügenschuh</lastName>
    </author>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
</export-example>
