<?xml version="1.0" encoding="UTF-8" standalone="no" ?>
<rss version="2.0">
  <channel>
    <title>Schobel, A.</title>
    <link>http://repub.eur.nl/res/aut/23106/</link>
    <description>List of Publications</description>
    <language>en</language>
    <image>
      <url>http://repub.eur.nl/static-eur/img/logo.png</url>
      <title>RePub, Erasmus University Rotterdam</title>
      <link>http://repub.eur.nl</link>
    </image>
    <item>
      <title>Delay Management including Capacities of Stations (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/37239/</link>
      <pubDate>2012-09-11T00:00:00Z</pubDate>
      <description>The question of delay management is whether trains should wait for delayed feeder
trains or should depart on time. Solutions to this problem strongly depend on the available
capacity of the railway infrastructure. While the limited capacity of the tracks has been
considered in delay management models, the limited capacity of the stations has been
neglected so far. In this paper, we develop a model for the delay management problem that
includes the stations’ capacities. This model allows to reschedule the platform assignment
dynamically. Furthermore, we propose an iterative algorithm in which we first solve the
delay management model with a fixed platform assignment and then improve this platform
assignment in each step. We show that the latter problem can be solved in polynomial
time by presenting a totally unimodular IP formulation. Finally, we present an extension
of the model that balances the delay of the passengers on the one hand and the number of
changes in the platform assignment on the other. All models are evaluated on real-world
instances from Netherlands Railways.</description>
    </item> <item>
      <title>Delay Management with Re-Routing of Passengers (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/19445/</link>
      <pubDate>2010-05-11T00:00:00Z</pubDate>
      <description>The question of delay management is whether trains should wait for a delayed feeder train
or should depart on time. In classical delay management models passengers always take
their originally planned route. In this paper, we propose a model where re-routing of
passengers is incorporated.
To describe the problem we represent it as an event-activity network similar to the one
used in classical delay management, with some additional events to incorporate origin
and destination of the passengers. We present an integer programming formulation of
this problem. Furthermore, we discuss the variant in which we assume fixed costs for
maintaining connections and we present a polynomial algorithm for the special case of
only one origin-destination pair. Finally, computational experiments based on real-world
data from Netherlands Railways show that significant improvements can be obtained by
taking the re-routing of passengers into account in the model.</description>
    </item>
  </channel>
</rss>