Algorithmic Methods for Railway Optimization
Springer Berlin (Verlag)
978-3-540-74245-6 (ISBN)
The volume covers algorithmic methods for analyzing and solving problems arising in railway optimization with special focus on the interplay between railway and other public transport systems. Beside algorithmics and mathematical optimization, the relevance of formal models and the influence of applicational aspects for problem modeling are considered as well. The papers also address experimental studies and or useful prototype implementations.
The 17 revised full papers presented were carefully reviewed and selected from numerous submissions and are organized in topical sections on network and line planning, timetabling and timetable information, rolling stock and crew scheduling, and real-time operations.
State of the Art.- The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond.- Cyclic Railway Timetabling: A Stochastic Optimization Approach.- Timetable Information: Models and Algorithms.- Estimates on Rolling Stock and Crew in DSB S-tog Based on Timetables.- A Capacity Test for Shunting Movements.- Railway Crew Pairing Optimization.- Integer Programming Approaches for Solving the Delay Management Problem.- Decision Support Tools for Customer-Oriented Dispatching.- Proceedings of ATMOS 2004.- An Integrated Methodology for the Rapid Transit Network Design Problem.- A Simulation Approach of Fare Integration in Regional Transit Services.- Intelligent Train Scheduling on a High-Loaded Railway Network.- Platform Assignment.- Finding All Attractive Train Connections by Multi-criteria Pareto Search.- The Railway Traveling Salesman Problem.- Rotation Planning of Locomotive and Carriage Groups with Shared Capacities.- An Estimate of the Punctuality Benefits of Automatic Operational Train Sequencing.- Online Delay Management on a Single Train Line.
| Erscheint lt. Verlag | 21.11.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XVI, 322 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 485 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmics • algorithms • Approximation • Complexity • Computational Discrete Mathematics • Computational Geometry • Computational Graph Theory • contraint programming • data structures • Genetic algorithms • Graph Algorithms • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Modeling • network algorithhms • network design • operatoins research • Optimization • rapid transiit systems • real-time • Real-Time Systems • Routing • Scheduling • shortest paths • Timetabling • Transport • Traveling Salesman Problem |
| ISBN-10 | 3-540-74245-X / 354074245X |
| ISBN-13 | 978-3-540-74245-6 / 9783540742456 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
