Výsledky vyhledávání - "Schilling, Heiko"

Akademický článek

Optimizing the Cargo Express Service of Swiss Federal Railways

Autor: Ceselli, Alberto, Gatto, Michael, Lübbecke, Marco E., Nunkesser, Marc, Schilling, Heiko

Publikováno v: Transportation Science, 2008 Nov 01. 42(4), 450-465.

Externí odkaz: https://www.jstor.org/stable/25769417

Zobrazit plný text záznamu

Optimizing the Cargo Express Service of Swiss Federal Railways

Autor: Ceselli, Alberto, Gatto, Michael, Lübbecke, Marco E., Nunkesser, Marc, Schilling, Heiko

The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is currently operated as a two-hub and spoke system. We present three different models fo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______793::a6114015e69eaf92bed5def2deb3e110
https://depositonce.tu-berlin.de/handle/11303/15584

Zobrazit plný text záznamu

Optimal route assignment in large scale micro-simulations

Autor: Edelhoff, Torben, Schilling, Heiko, Balmer, Michael, Möhring, Rolf H., Nagel, K.

Publikováno v: Arbeitsberichte Verkehrs-und Raumplanung, 409

Traffic management and route guidance are optimization problems by nature. In this article, we consider algorithms for centralized route guidance and discuss fairness aspects for the individual user resulting from optimal route guidance policies. The

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12fb4b49e4fc0e678fa6733aec68f2a7

Zobrazit plný text záznamu

Length-Bounded Cuts and Flows

Autor: Baier, Georg, Erlebach, Thomas, Hall, Alexander, Köhler, Ekkehard, Schilling, Heiko, Skutella, Martin

An L-length-bounded cut in a graph G with source s, and sink t is a cut that destroys all s-t-paths of length at most L. An L-length-bounded flow is a flow in which only flow paths of length at most L are used. The first research on path related cons

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______793::2351392b3f80fba1a26b40e95be75ec8
https://depositonce.tu-berlin.de/handle/11303/15600

Zobrazit plný text záznamu

Optimal Route Assignment in Large Scale Micro-Simulations

Autor: Balmer, Michael, Edelhoff, Torben, Möhring, Rolf H., Schilling, Heiko

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______793::65eac8bdc0bec3857f8b34c464d1b450
https://depositonce.tu-berlin.de/handle/11303/15593

Zobrazit plný text záznamu

Partitioning Graphs to Speed Up Dijkstra's Algorithm

Autor: Möhring, Rolf H., Schilling, Heiko, Schütz, Birk, Wagner, Dorothea, Willhalm, Thomas

In this paper, we consider Dijkstra's algorithm for the point-to-point shortest path problem in large and sparse graphs with a given layout. Lauther presented a method that uses a partitioning of the graph to perform a preprocessing which allows to s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______793::2a05327d6f09aefea0769700189dd4ac
https://depositonce.tu-berlin.de/handle/11303/15567

Zobrazit plný text záznamu

Flows over Time: Towards a more Realistic and Computationally Tractable Model

Autor: Hall, Alex, Schilling, Heiko

We introduce a novel model for "Flows over Time" which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is NP-hard and present an LP-based algorith

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______793::ef4e126e9f15a1099e9d308448974e37
https://depositonce.tu-berlin.de/handle/11303/15521

Zobrazit plný text záznamu