Ahuja / Möhring / Zaroliagis | Robust and Online Large-Scale Optimization | Buch | 978-3-642-05464-8 | sack.de

Buch, Englisch, 423 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 670 g

Reihe: Theoretical Computer Science and General Issues

Ahuja / Möhring / Zaroliagis

Robust and Online Large-Scale Optimization

Models and Techniques for Transportation Systems
1. Auflage 2009
ISBN: 978-3-642-05464-8
Verlag: Springer

Models and Techniques for Transportation Systems

Buch, Englisch, 423 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 670 g

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-05464-8
Verlag: Springer


Scheduled transportation networks give rise to very complex and large-scale networkoptimization problems requiring innovative solution techniques and ideas from mathematical optimization and theoretical computer science. Examples of scheduled transportation include bus, ferry, airline, and railway networks, with the latter being a prime application domain that provides a fair amount of the most complex and largest instances of such optimization problems. Scheduled transport optimization deals with planning and scheduling problems over several time horizons, and substantial progress has been made for strategic planning and scheduling problems in all transportation domains.

This state-of-the-art survey presents the outcome of an open call for contributions asking for either research papers or state-of-the-art survey articles. We received 24 submissions that underwent two rounds of the standard peer-review process, out of which 18 were finally accepted for publication.

The volume is organized in four parts: Robustness and Recoverability, Robust Timetabling and Route Planning, Robust Planning Under Scarce Resources, and Online Planning: Delay and Disruption Management.

Ahuja / Möhring / Zaroliagis Robust and Online Large-Scale Optimization jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Robustness and Recoverability: New Concepts.- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.- Recoverable Robustness in Shunting and Timetabling.- Light Robustness.- Incentive-Compatible Robust Line Planning.- A Bicriteria Approach for Robust Timetabling.- Robust Timetabling and Route Planning.- Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling.- Engineering Time-Expanded Graphs for Faster Timetable Information.- Time-Dependent Route Planning.- The Exact Subgraph Recoverable Robust Shortest Path Problem.- Efficient Timetable Information in the Presence of Delays.- Robust Planning under Scarce Resources.- Integrating Robust Railway Network Design and Line Planning under Failures.- Effective Allocation of Fleet Frequencies by Reducing Intermediate Stops and Short Turning in Transit Systems.- Shunting for Dummies: An Introductory Algorithmic Survey.- Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.- Online Planning: Delay and Disruption Management.- Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data.- Rescheduling Dense Train Traffic over Complex Station Interlocking Areas.- Online Train Disposition: To Wait or Not to Wait?.- Disruption Management in Passenger Railway Transportation.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.