15 Search Results for "Jacob, Riko"

Volume

OASIcs, Volume 5

6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)

ATMOS 2006, September 14, 2006, Zuerich, Switzerland

Editors: Riko Jacob and Matthias Müller-Hannemann

Document
DOI: 10.4230/LIPIcs.ITCS.2024.56
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio

Authors: Mayank Goswami and Riko Jacob

Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)

Abstract
The problem of sorting with priced information was introduced by [Charikar, Fagin, Guruswami, Kleinberg, Raghavan, Sahai (CFGKRS), STOC 2000]. In this setting, different comparisons have different (potentially infinite) costs. The goal is to find a sorting algorithm with small competitive ratio, defined as the (worst-case) ratio of the algorithm’s cost to the cost of the cheapest proof of the sorted order. The simple case of bichromatic sorting posed by [CFGKRS] remains open: We are given two sets A and B of total size N, and the cost of an A-A comparison or a B-B comparison is higher than an A-B comparison. The goal is to sort A ∪ B. An Ω(log N) lower bound on competitive ratio follows from unit-cost sorting. Note that this is a generalization of the famous nuts and bolts problem, where A-A and B-B comparisons have infinite cost, and elements of A and B are guaranteed to alternate in the final sorted order. In this paper we give a randomized algorithm InversionSort with an almost-optimal w.h.p. competitive ratio of O(log³ N). This is the first algorithm for bichromatic sorting with a o(N) competitive ratio.
Cite as

Mayank Goswami and Riko Jacob. An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 56:1-56:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{goswami_et_al:LIPIcs.ITCS.2024.56,
  author =	{Goswami, Mayank and Jacob, Riko},
  title =	{{An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio}},
  booktitle =	{15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
  pages =	{56:1--56:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-309-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{287},
  editor =	{Guruswami, Venkatesan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.56},
  URN =		{urn:nbn:de:0030-drops-195843},
  doi =		{10.4230/LIPIcs.ITCS.2024.56},
  annote =	{Keywords: Sorting, Priced Information, Nuts and Bolts}
}
Document
DOI: 10.4230/LIPIcs.ESA.2019.2
Fragile Complexity of Comparison-Based Algorithms

Authors: Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava

Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)

Abstract
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes part in. We give a number of upper and lower bounds on the fragile complexity for fundamental problems, including Minimum, Selection, Sorting and Heap Construction. The results include both deterministic and randomized upper and lower bounds, and demonstrate a separation between the two settings for a number of problems. The depth of a comparator network is a straight-forward upper bound on the worst case fragile complexity of the corresponding fragile algorithm. We prove that fragile complexity is a different and strictly easier property than the depth of comparator networks, in the sense that for some problems a fragile complexity equal to the best network depth can be achieved with less total work and that with randomization, even a lower fragile complexity is possible.
Cite as

Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava. Fragile Complexity of Comparison-Based Algorithms. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{afshani_et_al:LIPIcs.ESA.2019.2,
  author =	{Afshani, Peyman and Fagerberg, Rolf and Hammer, David and Jacob, Riko and Kostitsyna, Irina and Meyer, Ulrich and Penschuck, Manuel and Sitchinava, Nodari},
  title =	{{Fragile Complexity of Comparison-Based Algorithms}},
  booktitle =	{27th Annual European Symposium on Algorithms (ESA 2019)},
  pages =	{2:1--2:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-124-5},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{144},
  editor =	{Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.2},
  URN =		{urn:nbn:de:0030-drops-111235},
  doi =		{10.4230/LIPIcs.ESA.2019.2},
  annote =	{Keywords: Algorithms, comparison based algorithms, lower bounds}
}
Document
DOI: 10.4230/LIPIcs.ESA.2019.60
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms

Authors: John Iacono, Riko Jacob, and Konstantinos Tsakalidis

Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)

Abstract
We present priority queues in the external memory model with block size B and main memory size M that support on N elements, operation Update (a combination of operations Insert and DecreaseKey) in O(1/Blog_{M/B} N/B) amortized I/Os and operations ExtractMin and Delete in O(ceil[(M^epsilon)/B log_{M/B} N/B] log_{M/B} N/B) amortized I/Os, for any real epsilon in (0,1), using O(N/Blog_{M/B} N/B) blocks. Previous I/O-efficient priority queues either support these operations in O(1/Blog_2 N/B) amortized I/Os [Kumar and Schwabe, SPDP '96] or support only operations Insert, Delete and ExtractMin in optimal O(1/Blog_{M/B} N/B) amortized I/Os, however without supporting DecreaseKey [Fadel et al., TCS '99]. We also present buffered repository trees that support on a multi-set of N elements, operation Insert in O(1/Blog_M/B N/B) I/Os and operation Extract on K extracted elements in O(M^{epsilon} log_M/B N/B + K/B) amortized I/Os, using O(N/B) blocks. Previous results achieve O(1/Blog_2 N/B) I/Os and O(log_2 N/B + K/B) I/Os, respectively [Buchsbaum et al., SODA '00]. Our results imply improved O(E/Blog_{M/B} E/B) I/Os for single-source shortest paths, depth-first search and breadth-first search algorithms on massive directed dense graphs (V,E) with E = Omega (V^(1+epsilon)), epsilon > 0 and V = Omega (M), which is equal to the I/O-optimal bound for sorting E values in external memory.
Cite as

John Iacono, Riko Jacob, and Konstantinos Tsakalidis. External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{iacono_et_al:LIPIcs.ESA.2019.60,
  author =	{Iacono, John and Jacob, Riko and Tsakalidis, Konstantinos},
  title =	{{External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms}},
  booktitle =	{27th Annual European Symposium on Algorithms (ESA 2019)},
  pages =	{60:1--60:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-124-5},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{144},
  editor =	{Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.60},
  URN =		{urn:nbn:de:0030-drops-111817},
  doi =		{10.4230/LIPIcs.ESA.2019.60},
  annote =	{Keywords: priority queues, external memory, graph algorithms, shortest paths, depth-first search, breadth-first search}
}
Document
Complete Volume
DOI: 10.4230/OASIcs.ATMOS.2006
OASIcs, Volume 5, ATMOS'06, Complete Volume

Authors: Riko Jacob and Matthias Müller-Hannemann

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2007.1179
11. Multistage Methods for Freight Train Classification

Authors: Riko Jacob, Peter Marton, Jens Maue, and Marc Nunkesser

Published in: OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007)

Abstract
In this paper we establish a consistent encoding of freight train classification methods. This encoding scheme presents a powerful tool for efficient presentation and analysis of classification methods, which we successfully apply to illustrate the most relevant historic results from a more theoretical point of view. We analyze their performance precisely and develop new classification methods making use of the inherent optimality condition of the encoding. We conclude with deriving optimal algorithms and complexity results for restricted real-world settings.
Cite as

Riko Jacob, Peter Marton, Jens Maue, and Marc Nunkesser. 11. Multistage Methods for Freight Train Classification. In 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07). Open Access Series in Informatics (OASIcs), Volume 7, pp. 158-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{jacob_et_al:OASIcs.ATMOS.2007.1179,
  author =	{Jacob, Riko and Marton, Peter and Maue, Jens and Nunkesser, Marc},
  title =	{{11. Multistage Methods for Freight Train Classification}},
  booktitle =	{7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)},
  pages =	{158--174},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-04-0},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{7},
  editor =	{Ahuja, Ravindra K. and Liebchen, Christian and Mesa, Juan A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1179},
  URN =		{urn:nbn:de:0030-drops-11798},
  doi =		{10.4230/OASIcs.ATMOS.2007.1179},
  annote =	{Keywords: Freight trains, sorting algorithms, train classification, shunting, cargo}
}
Document
Front Matter
DOI: 10.4230/OASIcs.ATMOS.2006.690
ATMOS 2006 Preface -- Algorithmic Methods and Models for Optimization of Railways

Authors: Riko Jacob and Matthias Müller-Hannemann

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.689
ATMOS 2006 Abstracts Collection -- Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways

Authors: Riko Jacob and Matthias Müller-Hannemann

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.688
A Game-Theoretic Approach to Line Planning

Authors: Anita Schöbel and Silvia Schwarze

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.683
An Efficient MIP Model for Locomotive Scheduling with Time Windows

Authors: Martin Aronsson, Per Kreuger, and Jonatan Gjerdrum

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.685
Freight Service Design for the Italian Railways Company

Authors: Marco Campetella, Guglielmo Lulli, Ugo Pietropaoli, and Nicoletta Ricciardi

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.686
Locomotive and Wagon Scheduling in Freight Transport

Authors: Armin Fügenschuh, Henning Homfeld, Andreas Huck, and Alexander Martin

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.684
Periodic Metro Scheduling

Authors: Evangelos Bampas, Georgia Kaouri, Michael Lampis, and Aris Pagourtzis

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.682
QoS-aware Multicommodity Flows and Transportation Planning

Authors: George Tsaggouris and Christos Zaroliagis

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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
DOI: 10.4230/OASIcs.ATMOS.2006.687
Robustness and Recovery in Train Scheduling - a Case Study from DSB S-tog a/s

Authors: Mads Hofman, Line Madsen, Julie Jespersen Groth, Jens Clausen, and Jesper Larsen

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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}
}
  • Refine by Author
  • 7 Jacob, Riko
  • 3 Müller-Hannemann, Matthias
  • 1 Afshani, Peyman
  • 1 Aronsson, Martin
  • 1 Bampas, Evangelos
  • Show More...

  • Refine by Classification
  • 1 Hardware → External storage
  • 1 Theory of computation → Abstract machines
  • 1 Theory of computation → Data structures design and analysis
  • 1 Theory of computation → Design and analysis of algorithms
  • 1 Theory of computation → Graph algorithms analysis
  • Show More...

  • Refine by Keyword
  • 2 Train scheduling
  • 1 ATMOS
  • 1 Algorithmic Methods
  • 1 Algorithmic Methods and Models for Optimization of Railways
  • 1 Algorithms
  • Show More...

  • Refine by Type
  • 14 document
  • 1 volume

  • Refine by Publication Year
  • 10 2006
  • 2 2019
  • 1 2007
  • 1 2012
  • 1 2024

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact