eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
0
0
10.4230/OASIcs.ATMOS.2010
article
OASIcs, Volume 14, ATMOS'10, Complete Volume
Erlebach, Thomas
Lübbecke, Marco
OASIcs, Volume 14, ATMOS'10, Complete Volume
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010/OASIcs.ATMOS.2010.pdf
Analysis of Algorithms and Problem Complexity, Optimization, Graph Theory, Applications
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
i
ix
10.4230/OASIcs.ATMOS.2010.i
article
Frontmatter, Table of Contents, Preface, Organization
Erlebach, Thomas
Lübbecke, Marco
Titlepage, Table of Contents, Preface, Organization.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.i/OASIcs.ATMOS.2010.i.pdf
Titlepage
Table of Contents
Preface
Organization
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
1
12
10.4230/OASIcs.ATMOS.2010.1
article
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation
Caprara, Alberto
We summarize our experience in solving combinatorial optimization
problems arising in railway planning, illustrating all of these
problems as integer multicommodity flow ones and discussing the
main features of the mathematical programming models that were
successfully used in the 1990s and in recent years to solve them.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.1/OASIcs.ATMOS.2010.1.pdf
Railway Planning
Integer Multicommodity Flow
Integer Linear Programming Formulations
Lagrangian Relaxation
Column Generation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
13
23
10.4230/OASIcs.ATMOS.2010.13
article
Railway Track Allocation by Rapid Branching
Borndörfer, Ralf
Schlechte, Thomas
Weider, Steffen
The track allocation problem, also known as train
routing problem or train timetabling problem, is to find a
conflict-free set of train routes of maximum value in a railway
network. Although it can be modeled as a standard path packing
problem, instances of sizes relevant for real-world railway
applications could not be solved up to now. We propose a rapid
branching column generation approach that integrates the solution of
the LP relaxation of a path coupling formulation of the problem with
a special rounding heuristic. The approach is based on and exploits
special properties of the bundle method for the approximate solution
of convex piecewise linear functions. Computational results for
difficult instances of the benchmark library TTPLIB are reported.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.13/OASIcs.ATMOS.2010.13.pdf
track allocation problem
integer programming
rapid branching heuristic
proximal bundle method
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
24
33
10.4230/OASIcs.ATMOS.2010.24
article
Robust Train Routing and Online Re-scheduling
Caprara, Alberto
Galli, Laura
Kroon, Leo
Maróti, Gábor
Toth, Paolo
Train Routing is a problem that arises in the early phase of
the passenger railway planning process, usually several months
before operating the trains. The main goal is to assign each
train a stopping platform and the corresponding arrival/departure
paths through a railway station. It is also called Train Platforming when
referring to the platform assignment task. Railway stations often represent
bottlenecks and train delays can easily disrupt the routing schedule.
Thereby railway stations are responsible for a large part of the delay
propagation in the whole network. In this research we present
different models to compute robust routing schedules and we study
their power in an online context together with different re-scheduling
strategies. We also design a simulation framework and use it to evaluate
and compare the effectiveness of the proposed robust models and re-scheduling
algorithms using real-world data from Rete Ferroviaria Italiana, the main
Italian Railway Infrastructure Manager.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.24/OASIcs.ATMOS.2010.24.pdf
Railway optimisation
Train platforming
Robust planning
Online re-scheduling
Simulation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
34
44
10.4230/OASIcs.ATMOS.2010.34
article
Heuristics for the Traveling Repairman Problem with Profits
Dewilde, Thijs
Cattrysse, Dirk
Coene, Sofie
Spieksma, Frits C. R.
Vansteenwegen, Pieter
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue. We restrict our study to the case of a single server with nodes located in the Euclidean plane. We investigate properties of this problem, and we derive a mathematical model assuming that the number of visited nodes is known in advance. We describe a tabu search algorithm with multiple neighborhoods, and we test its performance by running it on instances based on TSPLIB. We conclude that the tabu search algorithm finds good-quality solutions fast, even for large instances.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.34/OASIcs.ATMOS.2010.34.pdf
Traveling Repairman
Profits
Latency
Tabu Search
Relief Efforts
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
45
60
10.4230/OASIcs.ATMOS.2010.45
article
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
Fischer, Frank
Helmberg, Christoph
The aim of the train timetabling problem is to find a conflict free
timetable for a set of passenger and freight trains along their routes in an
infrastructure network. Several constraints like station capacities and
train dependent running and headway times have to be satisfied.
In this work we deal with large scale instances of the aperiodic train
timetabling problem for the German railway network. The problem is modelled
in a classical way via time discretised networks, its Lagrange-dual is
solved by a bundle method. In order to handle the enormous number of
variables and constraints dynamic graph generation and dynamic rolling
horizon techniques are employed.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.45/OASIcs.ATMOS.2010.45.pdf
combinatorial optimization
train-timetabling
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
61
73
10.4230/OASIcs.ATMOS.2010.61
article
Vertex Disjoint Paths for Dispatching in Railways
Flier, Holger
Mihalák, Matús
Schöbel, Anita
Widmayer, Peter
Zych, Anna
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routing-in-rounds problem. Although all considered variants are NP-hard in planar graphs, restrictions on the location of the terminals, motivated by railway applications, lead to polynomially solvable cases for the decision and maximization versions of the problem, and to a $p$-approximation algorithm for the routing-in-rounds problem, where $p$ is the maximum number of alternative paths for a terminal pair.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.61/OASIcs.ATMOS.2010.61.pdf
algorithms
approximation
complexity
graph theory
railways
routing
transportation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
74
87
10.4230/OASIcs.ATMOS.2010.74
article
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
Geisberger, Robert
Sanders, Peter
Computing distance tables is important for many logistics problems like the vehicle routing problem (VRP).
While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not.
We present the first efficient algorithms to compute time-dependent travel time tables in large time-dependent road networks.
Our algorithms are based on time-dependent contraction hierarchies (TCH), currently the fastest time-dependent speed-up technique.
The computation of a table is inherently in Theta(|S|*|T|), and therefore inefficient for large tables.
We provide one particular algorithm using only Theta(|S|+|T|) time and space, being able to answer queries two orders of magnitude faster than the basic TCH implementation.
If small errors are acceptable, approximate versions of our algorithms are further orders of magnitude faster.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.74/OASIcs.ATMOS.2010.74.pdf
time-dependent
travel time table
algorithm engineering
vrp
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
88
99
10.4230/OASIcs.ATMOS.2010.88
article
Fast Detour Computation for Ride Sharing
Geisberger, Robert
Luxen, Dennis
Neubauer, Sabine
Sanders, Peter
Volker, Lars
Ride sharing becomes more and more popular not least because internet services help matching offers and request.
However, current systems use a rather simple-minded functionality allowing to search for the origin and destination city, sometimes enriched with radial search around the cities.
We show that theses services can be substantially improved using innovative route planning algorithms.
More concretely, we generalize previous static algorithms for many-to-many routing to a dynamic setting and develop an additional pruning strategy.
With these measures it becomes possible to match each request to $n$ offers using $2n+1$ exact travel time computations in a large road network in a fraction of a microsecond per offer.
For requests spread over Germany according to population density, we are able to reduce the number of failing entries substantially.
We are able to find a reasonable match for more than 60% of the failing entries left by contemporary matching strategies.
Additionally, we halve the average waste of resources in the matches found compared to radial search.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.88/OASIcs.ATMOS.2010.88.pdf
ride sharing
algorithm engineering
carpool
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
100
113
10.4230/OASIcs.ATMOS.2010.100
article
An Empirical Analysis of Robustness Concepts for Timetabling
Goerigk, Marc
Schöbel, Anita
Calculating timetables that are insensitive to disturbances has drawn
considerable research efforts due to its practical importance on the one hand
and its hard tractability by classical robustness concepts on the other hand.
Many different robustness concepts for timetabling have been suggested in the
literature, some of them very recently. In this paper we compare such concepts
on real-world instances. We also introduce a new approach that is generically
applicable to any robustness problem. Nevertheless it is able to adapt the
special characteristics of the respective problem structure and hence generates
solutions that fit to the needs of the respective problem.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.100/OASIcs.ATMOS.2010.100.pdf
Timetabling
Robust Optimization
Algorithm Engineering
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
114
129
10.4230/OASIcs.ATMOS.2010.114
article
Traffic Signal Optimization Using Cyclically Expanded Networks
Köhler, Ekkehard
Strehler, Martin
Traditionally, the coordination of multiple traffic signals and the
traffic assignment problem in an urban street network are considered
as two separate optimization problems. However, it is easy to see
that the traffic assignment has an influence on the optimal signal
coordination and, vice versa, a change in the signal coordination
changes the optimal traffic assignment. In this paper we present a
cyclically time-expanded network and a corresponding mixed integer
linear programming formulation for simultaneously optimizing both
the coordination of traffic signals and the traffic assignment in an
urban street network. Although the new cyclically time-expanded
network provides a model of both traffic and signals close to
reality, it still has the advantage of a linear objective function.
Using this model we compute optimized signal coordinations and
traffic assignment on real-world street networks. To evaluate the
practical relevance of the computed solutions we conduct extensive
simulation experiments using two established traffic simulation
tools that reveal the advantages of our model.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.114/OASIcs.ATMOS.2010.114.pdf
dynamic flow
traffic optimization
traffic signals
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
130
141
10.4230/OASIcs.ATMOS.2010.130
article
Column Generation Heuristic for a Rich Arc Routing Problem
Lannez, Sébastien
Artigues, Christian
Damay, Jean
Gendreau, Michel
In this paper we address a real world optimisation
problem, the Rail Track Inspection Scheduling Problem (RTISP).
This problem consists of scheduling network inspection tasks.
The objective is to minimise total deadhead distance.
A mixed integer formulation of the problem
is presented. A column generation based algorithm is proposed
to solve this rich arc routing problem. Its performance
is analysed by benchmarking a real world dataset from the French national
railway company (SNCF). The efficiency of the algorithm is compared
to an enhanced greedy algorithm. Its ability to schedule one
year of inspection tasks on a sparse graph with thousand nodes, arcs
and edges is assessed.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.130/OASIcs.ATMOS.2010.130.pdf
arc routing
column generation
heuristic
railtrack maintenance
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
142
155
10.4230/OASIcs.ATMOS.2010.142
article
The Team Orienteering Problem: Formulations and Branch-Cut and Price
Poggi, Marcus
Viana, Henrique
Uchoa, Eduardo
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical vehicles, with a limited total duration for their routes, is given. The total profit gathered by all routes is to be maximized.
We devise an extended formulation where edges are indexed by the time they are placed in the route. A new class of inequalities, min cut, and the triangle clique cuts of Pessoa et. al., 2007 are added. The resulting formulation is solved by column generation. Branching is done following the work of Boussier et al. 2007, to which the branch-cut-and-price algorithm here proposed is compared. A few new upper bounds were obtained. Overall the presented approach has shown to be very competitive.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.142/OASIcs.ATMOS.2010.142.pdf
Branch-Cut and Price
Team Orienteering Problem
Column Generation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2010-09-01
14
156
169
10.4230/OASIcs.ATMOS.2010.156
article
The Complexity of Integrating Routing Decisions in Public Transportation Models
Schmidt, Marie
Schöbel, Anita
To model and solve optimization problems arising in public
transportation, data about the passengers is necessary and has to be
included in the models in any phase of the planning process. Many
approaches assume a two-step procedure: in a first step, the data
about the passengers is distributed over the public transportation
network using traffic-assignment procedures. In a second step, the
actual planning of lines, timetables, etc. takes place. This approach
ignores that for most passengers there are many possible ways to reach
their destinations in the public transportation network, thus the
actual connections the passengers will take depend strongly on the
decisions made during the planning phase. In this paper we
investigate the influence of integrating the traffic assignment
procedure in the optimization process on the complexity of line
planning and aperiodic timetabling. In both problems, our objective is
to maximize the passengers' benefit, namely to minimize the overall
travel time of the passengers in the network. We present new models,
analyze NP-hardness results arising from the integration of the routing
decisions in the traditional models, and derive polynomial algorithms
for special cases.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol014-atmos2010/OASIcs.ATMOS.2010.156/OASIcs.ATMOS.2010.156.pdf
Line Planning
Timetabling
Routing