Robust and Online Large-Scale Optimization Models and Techniques for Transportation Systems /

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 n...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Ahuja, Ravindra K. (Επιμελητής έκδοσης), Möhring, Rolf H. (Επιμελητής έκδοσης), Zaroliagis, Christos D. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Σειρά:Lecture Notes in Computer Science, 5868
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04771nam a22006375i 4500
001 978-3-642-05465-5
003 DE-He213
005 20151204170454.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642054655  |9 978-3-642-05465-5 
024 7 |a 10.1007/978-3-642-05465-5  |2 doi 
040 |d GrThAP 
050 4 |a QA76.76.R44 
050 4 |a TK5105.5956 
072 7 |a UYD  |2 bicssc 
072 7 |a UKR  |2 bicssc 
072 7 |a COM067000  |2 bisacsh 
082 0 4 |a 004.24  |2 23 
245 1 0 |a Robust and Online Large-Scale Optimization  |h [electronic resource] :  |b Models and Techniques for Transportation Systems /  |c edited by Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2009. 
300 |a XVIII, 423 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5868 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer software  |x Reusability. 
650 0 |a Special purpose computers. 
650 0 |a Computer system failures. 
650 0 |a Computer simulation. 
650 0 |a Combinatorics. 
650 0 |a Quality control. 
650 0 |a Reliability. 
650 0 |a Industrial safety. 
650 1 4 |a Computer Science. 
650 2 4 |a Performance and Reliability. 
650 2 4 |a System Performance and Evaluation. 
650 2 4 |a Special Purpose and Application-Based Systems. 
650 2 4 |a Simulation and Modeling. 
650 2 4 |a Quality Control, Reliability, Safety and Risk. 
650 2 4 |a Combinatorics. 
700 1 |a Ahuja, Ravindra K.  |e editor. 
700 1 |a Möhring, Rolf H.  |e editor. 
700 1 |a Zaroliagis, Christos D.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642054648 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5868 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-05465-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)