Volume
OASIcs, Volume 14
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)
Event
ATMOS 2010, September 9, 2010, Liverpool, United KingdomEditors
Publication Details
- published at: 2010-09-01
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-20-0
- DBLP: db/conf/atmos/atmos2010
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 14, ATMOS'10, Complete Volume
Abstract
OASIcs, Volume 14, ATMOS'10, Complete Volume
Cite as
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Proceedings{erlebach_et_al:OASIcs.ATMOS.2010,
title = {{OASIcs, Volume 14, ATMOS'10, Complete Volume}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2012},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010},
URN = {urn:nbn:de:0030-drops-35767},
doi = {10.4230/OASIcs.ATMOS.2010},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Graph Theory, Applications}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Organization
Abstract
Titlepage, Table of Contents, Preface, Organization.
Cite as
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. i-ix, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{erlebach_et_al:OASIcs.ATMOS.2010.i,
author = {Erlebach, Thomas and L\"{u}bbecke, Marco},
title = {{Frontmatter, Table of Contents, Preface, Organization}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {i--ix},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.i},
URN = {urn:nbn:de:0030-drops-27584},
doi = {10.4230/OASIcs.ATMOS.2010.i},
annote = {Keywords: Titlepage, Table of Contents, Preface, Organization}
}
Document
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation
Abstract
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.
Cite as
Alberto Caprara. Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{caprara:OASIcs.ATMOS.2010.1,
author = {Caprara, Alberto},
title = {{Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {1--12},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.1},
URN = {urn:nbn:de:0030-drops-27452},
doi = {10.4230/OASIcs.ATMOS.2010.1},
annote = {Keywords: Railway Planning, Integer Multicommodity Flow, Integer Linear Programming Formulations, Lagrangian Relaxation, Column Generation}
}
Document
Railway Track Allocation by Rapid Branching
Abstract
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.
Cite as
Ralf Borndörfer, Thomas Schlechte, and Steffen Weider. Railway Track Allocation by Rapid Branching. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 13-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2010.13,
author = {Bornd\"{o}rfer, Ralf and Schlechte, Thomas and Weider, Steffen},
title = {{Railway Track Allocation by Rapid Branching}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {13--23},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.13},
URN = {urn:nbn:de:0030-drops-27465},
doi = {10.4230/OASIcs.ATMOS.2010.13},
annote = {Keywords: track allocation problem, integer programming, rapid branching heuristic, proximal bundle method}
}
Document
Robust Train Routing and Online Re-scheduling
Abstract
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.
Cite as
Alberto Caprara, Laura Galli, Leo Kroon, Gábor Maróti, and Paolo Toth. Robust Train Routing and Online Re-scheduling. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 24-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{caprara_et_al:OASIcs.ATMOS.2010.24,
author = {Caprara, Alberto and Galli, Laura and Kroon, Leo and Mar\'{o}ti, G\'{a}bor and Toth, Paolo},
title = {{Robust Train Routing and Online Re-scheduling}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {24--33},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.24},
URN = {urn:nbn:de:0030-drops-27470},
doi = {10.4230/OASIcs.ATMOS.2010.24},
annote = {Keywords: Railway optimisation, Train platforming, Robust planning, Online re-scheduling, Simulation}
}
Document
Heuristics for the Traveling Repairman Problem with Profits
Abstract
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.
Cite as
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, and Pieter Vansteenwegen. Heuristics for the Traveling Repairman Problem with Profits. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 34-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{dewilde_et_al:OASIcs.ATMOS.2010.34,
author = {Dewilde, Thijs and Cattrysse, Dirk and Coene, Sofie and Spieksma, Frits C. R. and Vansteenwegen, Pieter},
title = {{Heuristics for the Traveling Repairman Problem with Profits}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {34--44},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.34},
URN = {urn:nbn:de:0030-drops-27489},
doi = {10.4230/OASIcs.ATMOS.2010.34},
annote = {Keywords: Traveling Repairman, Profits, Latency, Tabu Search, Relief Efforts}
}
Document
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
Abstract
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.
Cite as
Frank Fischer and Christoph Helmberg. Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 45-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{fischer_et_al:OASIcs.ATMOS.2010.45,
author = {Fischer, Frank and Helmberg, Christoph},
title = {{Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {45--60},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.45},
URN = {urn:nbn:de:0030-drops-27492},
doi = {10.4230/OASIcs.ATMOS.2010.45},
annote = {Keywords: combinatorial optimization, train-timetabling}
}
Document
Vertex Disjoint Paths for Dispatching in Railways
Abstract
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.
Cite as
Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych. Vertex Disjoint Paths for Dispatching in Railways. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 61-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{flier_et_al:OASIcs.ATMOS.2010.61,
author = {Flier, Holger and Mihal\'{a}k, Mat\'{u}s and Sch\"{o}bel, Anita and Widmayer, Peter and Zych, Anna},
title = {{Vertex Disjoint Paths for Dispatching in Railways}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {61--73},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.61},
URN = {urn:nbn:de:0030-drops-27508},
doi = {10.4230/OASIcs.ATMOS.2010.61},
annote = {Keywords: algorithms, approximation, complexity, graph theory, railways, routing, transportation}
}
Document
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
Abstract
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.
Cite as
Robert Geisberger and Peter Sanders. Engineering Time-Dependent Many-to-Many Shortest Paths Computation. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 74-87, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{geisberger_et_al:OASIcs.ATMOS.2010.74,
author = {Geisberger, Robert and Sanders, Peter},
title = {{Engineering Time-Dependent Many-to-Many Shortest Paths Computation}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {74--87},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.74},
URN = {urn:nbn:de:0030-drops-27511},
doi = {10.4230/OASIcs.ATMOS.2010.74},
annote = {Keywords: time-dependent, travel time table, algorithm engineering, vrp}
}
Document
Fast Detour Computation for Ride Sharing
Abstract
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.
Cite as
Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, and Lars Volker. Fast Detour Computation for Ride Sharing. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 88-99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{geisberger_et_al:OASIcs.ATMOS.2010.88,
author = {Geisberger, Robert and Luxen, Dennis and Neubauer, Sabine and Sanders, Peter and Volker, Lars},
title = {{Fast Detour Computation for Ride Sharing}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {88--99},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.88},
URN = {urn:nbn:de:0030-drops-27525},
doi = {10.4230/OASIcs.ATMOS.2010.88},
annote = {Keywords: ride sharing, algorithm engineering, carpool}
}
Document
An Empirical Analysis of Robustness Concepts for Timetabling
Abstract
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.
Cite as
Marc Goerigk and Anita Schöbel. An Empirical Analysis of Robustness Concepts for Timetabling. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 100-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{goerigk_et_al:OASIcs.ATMOS.2010.100,
author = {Goerigk, Marc and Sch\"{o}bel, Anita},
title = {{An Empirical Analysis of Robustness Concepts for Timetabling}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {100--113},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.100},
URN = {urn:nbn:de:0030-drops-27537},
doi = {10.4230/OASIcs.ATMOS.2010.100},
annote = {Keywords: Timetabling, Robust Optimization, Algorithm Engineering}
}
Document
Traffic Signal Optimization Using Cyclically Expanded Networks
Abstract
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.
Cite as
Ekkehard Köhler and Martin Strehler. Traffic Signal Optimization Using Cyclically Expanded Networks. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 114-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{kohler_et_al:OASIcs.ATMOS.2010.114,
author = {K\"{o}hler, Ekkehard and Strehler, Martin},
title = {{Traffic Signal Optimization Using Cyclically Expanded Networks}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {114--129},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.114},
URN = {urn:nbn:de:0030-drops-27542},
doi = {10.4230/OASIcs.ATMOS.2010.114},
annote = {Keywords: dynamic flow, traffic optimization, traffic signals}
}
Document
Column Generation Heuristic for a Rich Arc Routing Problem
Abstract
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.
Cite as
Sébastien Lannez, Christian Artigues, Jean Damay, and Michel Gendreau. Column Generation Heuristic for a Rich Arc Routing Problem. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 130-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{lannez_et_al:OASIcs.ATMOS.2010.130,
author = {Lannez, S\'{e}bastien and Artigues, Christian and Damay, Jean and Gendreau, Michel},
title = {{Column Generation Heuristic for a Rich Arc Routing Problem}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {130--141},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.130},
URN = {urn:nbn:de:0030-drops-27559},
doi = {10.4230/OASIcs.ATMOS.2010.130},
annote = {Keywords: arc routing, column generation, heuristic, railtrack maintenance}
}
Document
The Team Orienteering Problem: Formulations and Branch-Cut and Price
Abstract
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.
Cite as
Marcus Poggi, Henrique Viana, and Eduardo Uchoa. The Team Orienteering Problem: Formulations and Branch-Cut and Price. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 142-155, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{poggi_et_al:OASIcs.ATMOS.2010.142,
author = {Poggi, Marcus and Viana, Henrique and Uchoa, Eduardo},
title = {{The Team Orienteering Problem: Formulations and Branch-Cut and Price}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {142--155},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.142},
URN = {urn:nbn:de:0030-drops-27561},
doi = {10.4230/OASIcs.ATMOS.2010.142},
annote = {Keywords: Branch-Cut and Price, Team Orienteering Problem, Column Generation}
}
Document
The Complexity of Integrating Routing Decisions in Public Transportation Models
Abstract
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.
Cite as
Marie Schmidt and Anita Schöbel. The Complexity of Integrating Routing Decisions in Public Transportation Models. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 156-169, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Copy BibTex To Clipboard
@InProceedings{schmidt_et_al:OASIcs.ATMOS.2010.156,
author = {Schmidt, Marie and Sch\"{o}bel, Anita},
title = {{The Complexity of Integrating Routing Decisions in Public Transportation Models}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {156--169},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Erlebach, Thomas and L\"{u}bbecke, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.156},
URN = {urn:nbn:de:0030-drops-27575},
doi = {10.4230/OASIcs.ATMOS.2010.156},
annote = {Keywords: Line Planning, Timetabling, Routing}
}