TY - JOUR A1 - Borndörfer, Ralf A1 - Grötschel, Martin A1 - Lukac, Sascha A1 - Mitusch, Kay A1 - Schlechte, Thomas A1 - Schultz, Sören A1 - Tanner, Andreas T1 - An Auctioning Approach to Railway Slot Allocation JF - Competition and Regulation in Network Industries Y1 - 2006 VL - 1 IS - 2 SP - 163 EP - 196 ER - TY - CHAP A1 - Erol, Berkan A1 - Klemenz, Marc A1 - Schlechte, Thomas A1 - Schultz, Sören A1 - Tanner, Andreas ED - Tomii, A. ED - Allan, J. ED - Arias, E. ED - Brebbia, C. ED - Goodman, C. ED - Rumsey, A. ED - Sciutto, G. T1 - TTPlib 2008 - A Library for Train Timetabling Problems T2 - Computers in Railways XI Y1 - 2008 UR - http://opus.kobv.de/zib/volltexte/2008/1102/ PB - WIT Press ER - TY - GEN A1 - Erol, Berkan A1 - Klemenz, Marc A1 - Schlechte, Thomas A1 - Schultz, Sören A1 - Tanner, Andreas T1 - TTPLIB 2008 - A Library for Train Timetabling Problems N2 - We introduce (TTPlib), a data library for train timetabling problems that can be accessed at http://ttplib.zib.de. In version 1.0, the library contains data related to 50 scenarios. Most instances result from the combination of macroscopic railway networks and several train request sets for the German long distance area containing Hannover, Kassel and Fulda, short denoted by Ha-Ka-Fu. In this paper, we introduce the data concepts of TTPlib, describe the scenarios included in the library and provide a free visualization tool TraVis. T3 - ZIB-Report - 08-19 KW - Fahrplanung KW - Problembibliothek KW - Optimierung KW - Train Timetabling Problem KW - Data Library KW - Optimization Y1 - 2008 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10732 SN - 1438-0064 ER - TY - GEN A1 - Borndörfer, Ralf A1 - Grötschel, Martin A1 - Lukac, Sascha A1 - Mitusch, Kay A1 - Schlechte, Thomas A1 - Schultz, Sören A1 - Tanner, Andreas T1 - An Auctioning Approach to Railway Slot Allocation N2 - We present an approach to implement an auction of railway slots. Railway network, train driving characteristics, and safety requirements are described by a simplified, but still complex macroscopic model. In this environment, slots are modelled as combinations of scheduled track segments. The auction design builds on the iterative combinatorial auction. However, combinatorial bids are restricted to some types of slot bundles that realize positive synergies between slots. We present a bidding language that allows bidding for these slot bundles. An integer programming approach is proposed to solve the winner determination problem of our auction. Computational results for auction simulations in the Hannover-Fulda-Kassel area of the German railway network give evidence that auction approaches can induce a more efficient use of railway capacity. T3 - ZIB-Report - 05-45 KW - Railway Slot Allocation KW - Train Dispatching KW - Combinatorial Auctions Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8786 ER -