Sciweavers

ATMOS
2010
169views Optimization» more  ATMOS 2010»
13 years 10 months ago
Traffic Signal Optimization Using Cyclically Expanded Networks
Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. How...
Ekkehard Köhler, Martin Strehler
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 10 months ago
Heuristics for the Traveling Repairman Problem with Profits
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...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 11 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
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 ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
ATMOS
2010
130views Optimization» more  ATMOS 2010»
13 years 11 months ago
Fast Detour Computation for Ride Sharing
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...
Robert Geisberger, Dennis Luxen, Sabine Neubauer, ...
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 11 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
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...
Marie Schmidt, Anita Schöbel
ATMOS
2010
172views Optimization» more  ATMOS 2010»
13 years 11 months ago
Column Generation Heuristic for a Rich Arc Routing Problem
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...
Sébastien Lannez, Christian Artigues, Jean ...
ATMOS
2010
150views Optimization» more  ATMOS 2010»
13 years 11 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
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 ...
Frank Fischer, Christoph Helmberg
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 11 months ago
Railway Track Allocation by Rapid Branching
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 netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 11 months ago
Vertex Disjoint Paths for Dispatching in Railways
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...
Holger Flier, Matús Mihalák, Anita S...