
doi: 10.2495/safe110341
handle: 11570/3220094
This paper reports on a procedure to find shortest paths and an application on the route design problem in a time-dependent network. In the application on the real network, the data, which are obtained with real-time observations, are integrated with forecast data to define the costs on non-observed network elements that were obtained from a dynamic traffic simulation. The real case application is performed in emergency conditions and the aim is to optimize emergency vehicle routes (defined as a path succession) to reduce intervention times.
Dynamic shortest path algorithm; Emergency conditions; Route design; Time-dependent network
Dynamic shortest path algorithm; Emergency conditions; Route design; Time-dependent network
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
