Volume
OASIcs, Volume 5
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)
Event
ATMOS 2006, September 14, 2006, Zuerich, SwitzerlandEditors
Publication Details
- published at: 2006-08-29
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-01-9
- DBLP: db/conf/atmos/atmos2006
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 5, ATMOS'06, Complete Volume
Abstract
OASIcs, Volume 5, ATMOS'06, Complete Volume
Cite as
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Proceedings{jacob_et_al:OASIcs.ATMOS.2006,
title = {{OASIcs, Volume 5, ATMOS'06, Complete Volume}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2012},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006},
URN = {urn:nbn:de:0030-drops-35675},
doi = {10.4230/OASIcs.ATMOS.2006},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Graph Theory, Applications}
}
Document
Front Matter
ATMOS 2006 Preface -- Algorithmic Methods and Models for Optimization of Railways
Abstract
The 6th Workshop on Algorithmic Methods and Models for Optimization
of Railways (ATMOS 06) is held on September 14, 2006 in Z{\"u}rich, Switzerland
(http://algo06.inf.ethz.ch/atmos), as part of the ALGO meeting.
Cite as
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. i-v, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{jacob_et_al:OASIcs.ATMOS.2006.690,
author = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
title = {{ATMOS 2006 Preface -- Algorithmic Methods and Models for Optimization of Railways}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {i--v},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.690},
URN = {urn:nbn:de:0030-drops-6909},
doi = {10.4230/OASIcs.ATMOS.2006.690},
annote = {Keywords: Railway Optimization, Algorithmic Methods, Models}
}
Document
ATMOS 2006 Abstracts Collection -- Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways
Abstract
The 6th Workshop on Algorithmic Methods and Models for Optimization of
Railways (ATMOS 06) is held
on September 14, 2006 in Zürich, Switzerland
(http://algo06.inf.ethz.ch/atmos), as part of the ALGO meeting.
Cite as
Riko Jacob and Matthias Müller-Hannemann. ATMOS 2006 Abstracts Collection -- Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{jacob_et_al:OASIcs.ATMOS.2006.689,
author = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
title = {{ATMOS 2006 Abstracts Collection -- Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--4},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.689},
URN = {urn:nbn:de:0030-drops-6898},
doi = {10.4230/OASIcs.ATMOS.2006.689},
annote = {Keywords: Algorithmic Methods and Models for Optimization of Railways, ATMOS}
}
Document
A Game-Theoretic Approach to Line Planning
Abstract
We present a game-theoretic model for the line planning problem
in public transportation, in which each line acts as player and aims to
minimize a cost function which is related to the traffic along its edges.
We analyze the model and in particular show that a potential function exists.
Based on this result, we present a method for calculating equilibria and
present first numerical results using the railway network
of {it Deutsche Bahn}.
Cite as
Anita Schöbel and Silvia Schwarze. A Game-Theoretic Approach to Line Planning. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{schobel_et_al:OASIcs.ATMOS.2006.688,
author = {Sch\"{o}bel, Anita and Schwarze, Silvia},
title = {{A Game-Theoretic Approach to Line Planning}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.688},
URN = {urn:nbn:de:0030-drops-6887},
doi = {10.4230/OASIcs.ATMOS.2006.688},
annote = {Keywords: Line Planning, Network Game, Equilibrium}
}
Document
An Efficient MIP Model for Locomotive Scheduling with Time Windows
Abstract
This paper presents an IP model for a vehicle routing and scheduling
problem from the domain of freight railways. The problem is non-capacitated
but allows non-binary integer flows of vehicles between transports
with departure times variable within fixed intervals. The model has
been developed with and has found practical use at Green Cargo, the
largest freight rail operator in Sweden.
Cite as
Martin Aronsson, Per Kreuger, and Jonatan Gjerdrum. An Efficient MIP Model for Locomotive Scheduling with Time Windows. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{aronsson_et_al:OASIcs.ATMOS.2006.683,
author = {Aronsson, Martin and Kreuger, Per and Gjerdrum, Jonatan},
title = {{An Efficient MIP Model for Locomotive Scheduling with Time Windows}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.683},
URN = {urn:nbn:de:0030-drops-6833},
doi = {10.4230/OASIcs.ATMOS.2006.683},
annote = {Keywords: Vehicle routing and scheduling, rail traffic resource management, resource levelling}
}
Document
Freight Service Design for the Italian Railways Company
Abstract
In this paper, we present a mathematical model to design
the service network, that is the set of origin-destination
connections. The resulting model considers both full and empty
freight car movements, and takes into account handling costs. More
specifically, the model suggests the services to provide, as well
as the number of trains and the number and type of cars traveling
on each connection. Quality of service, which is measured as total
travel time, is established by minimizing the waiting time of cars
at intermediate stations.
Our approach yields a multi-commodity network design problem with
concave arc cost functions. To solve this problem, we implement a
tabu search procedure which adopts ``perturbing'' mechanisms to
force the algorithm to explore a larger portion of the feasible
region. Computational results on realistic instances show a
significant improvement over current practice.
Cite as
Marco Campetella, Guglielmo Lulli, Ugo Pietropaoli, and Nicoletta Ricciardi. Freight Service Design for the Italian Railways Company. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{campetella_et_al:OASIcs.ATMOS.2006.685,
author = {Campetella, Marco and Lulli, Guglielmo and Pietropaoli, Ugo and Ricciardi, Nicoletta},
title = {{Freight Service Design for the Italian Railways Company}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.685},
URN = {urn:nbn:de:0030-drops-6850},
doi = {10.4230/OASIcs.ATMOS.2006.685},
annote = {Keywords: Railways transportation, service network design, tabu search}
}
Document
Locomotive and Wagon Scheduling in Freight Transport
Abstract
We present a new model for a strategic locomotive scheduling problem
arising at the Deutsche Bahn AG. The model is based on a
multi-commodity min-cost flow formulation that is also used for
public bus scheduling problems. However, several new aspects have to
be additionally taken into account, such as cyclic departures of the
trains, time windows on starting and arrival times, network-load
dependend travel times, and a transfer of wagons between trains. The
model is formulated as an integer programming problem, and solutions
are obtained using commercial standard software. Computational
results for several test instances are presented.
Cite as
Armin Fügenschuh, Henning Homfeld, Andreas Huck, and Alexander Martin. Locomotive and Wagon Scheduling in Freight Transport. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{fugenschuh_et_al:OASIcs.ATMOS.2006.686,
author = {F\"{u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander},
title = {{Locomotive and Wagon Scheduling in Freight Transport}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.686},
URN = {urn:nbn:de:0030-drops-6863},
doi = {10.4230/OASIcs.ATMOS.2006.686},
annote = {Keywords: Freight Transport, Vehicle Scheduling, Time Windows, Integer Programming.}
}
Document
Periodic Metro Scheduling
Abstract
We introduce the { extsc{Periodic Metro Sched-ul-ing}} ({ extsc{PMS}}) problem,
which aims in generating a
periodic timetable for a given set of routes and a given time
period, in such a way that the minimum time distance between any two
successive trains that pass from the same point of the network is
maximized. This can be particularly useful in cases where trains use
the same rail segment quite often, as happens in metropolitan rail
networks.
We present exact algorithms for ({ extsc{PMS}}) in chain and spider networks,
and constant ratio approximation algorithms for ring networks and
for a special class of tree networks. Some of our algorithms are
based on a reduction to the { extsc{Path Coloring}} problem, while others rely on
techniques specially designed for the new problem.
Cite as
Evangelos Bampas, Georgia Kaouri, Michael Lampis, and Aris Pagourtzis. Periodic Metro Scheduling. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{bampas_et_al:OASIcs.ATMOS.2006.684,
author = {Bampas, Evangelos and Kaouri, Georgia and Lampis, Michael and Pagourtzis, Aris},
title = {{Periodic Metro Scheduling}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.684},
URN = {urn:nbn:de:0030-drops-6841},
doi = {10.4230/OASIcs.ATMOS.2006.684},
annote = {Keywords: Train scheduling, path coloring, delay-tolerant scheduling, periodic timetabling}
}
Document
QoS-aware Multicommodity Flows and Transportation Planning
Abstract
We consider the emph{QoS-aware Multicommodity Flow} problem, a
natural generalization of the weighted multicommodity flow problem
where the demands and commodity values are elastic to the
Quality-of-Service characteristics of the underlying network. The
problem is fundamental in transportation planning and also has
important applications beyond the transportation domain. We
provide a FPTAS for the QoS-aware Multicommodity Flow problem by
building upon a Lagrangian relaxation method and a recent FPTAS
for the non-additive shortest path problem.
Cite as
George Tsaggouris and Christos Zaroliagis. QoS-aware Multicommodity Flows and Transportation Planning. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{tsaggouris_et_al:OASIcs.ATMOS.2006.682,
author = {Tsaggouris, George and Zaroliagis, Christos},
title = {{QoS-aware Multicommodity Flows and Transportation Planning}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.682},
URN = {urn:nbn:de:0030-drops-6827},
doi = {10.4230/OASIcs.ATMOS.2006.682},
annote = {Keywords: Quality of service, multicommodity flows, fully polynomial approximation scheme, transportation planning}
}
Document
Robustness and Recovery in Train Scheduling - a Case Study from DSB S-tog a/s
Abstract
This paper presents a simulation model to study the robustness of
timetables of DSB S-tog a/s, the city rail of Copenhagen. Dealing with
rush hour scenarios only, the simulation model
investigates the effects of disturbances
on the S-tog network. Several timetables are analyzed with respect
to robustness. Some of these are used in operation and some are generated
for the purpose of investigating timetables with specific alternative
characteristics.
Cite as
Mads Hofman, Line Madsen, Julie Jespersen Groth, Jens Clausen, and Jesper Larsen. Robustness and Recovery in Train Scheduling - a Case Study from DSB S-tog a/s. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
Copy BibTex To Clipboard
@InProceedings{hofman_et_al:OASIcs.ATMOS.2006.687,
author = {Hofman, Mads and Madsen, Line and Jespersen Groth, Julie and Clausen, Jens and Larsen, Jesper},
title = {{Robustness and Recovery in Train Scheduling - a Case Study from DSB S-tog a/s}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
pages = {1--22},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.687},
URN = {urn:nbn:de:0030-drops-6878},
doi = {10.4230/OASIcs.ATMOS.2006.687},
annote = {Keywords: Train scheduling, simulation model, robustness, recovery}
}