Titlebook: Robust and Online Large-Scale Optimization; Models and Technique Ravindra K. Ahuja,Rolf H. M?hring,Christos D. Zaro Book 2009 Springer-Verl

MITE

The Exact Subgraph Recoverable Robust Shortest Path Problem by simple means such as announcements. We introduce a model, in which the passenger computes his optimal route on his mobile device in a given subnetwork according to the actual travel times. Those travel times are sent to him as soon as a delay occurs..The main focus of this paper is on the calcul

landfill

occult

Atheroma

Acclaim

Factual

Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data such propagation as much as possible. To improve existing timetables, tools for automatic detection of systematic dependencies of delays among trains would be of great aid. We present efficient algorithms to detect two of the most important types of dependencies, namely dependencies due to resource

懸崖

Rescheduling Dense Train Traffic over Complex Station Interlocking Areasis task becomes more difficult when dealing with complex interlocking areas, since operational rules constrain the passage of trains through short track sections. This paper presents a detailed microscopic representation of the railway network that is able to tackle the complexity of a station area

Limerick

運(yùn)動(dòng)的我

合唱團(tuán)

Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetablingme (both at changeovers and onboard), efficient use of trains, etc. Due to its central role in the planning process of railway scheduling, timetable design has many interfaces with other classical problems: line planning, vehicle scheduling, and delay management.