haku: @author Nachtigall, K. / yhteensä: 2
viite: 2 / 2
« edellinen | seuraava »
| Tekijä: | Nachtigall, K. |
| Otsikko: | Time depending shortest-path length in a road network with obstacles |
| Lehti: | European Journal of Operational Research
1995 : MAY 18, VOL. 83:1, p. 154-166 |
| Asiasana: | TRANSPORT RAIL TRANSPORT NETWORKS |
| Kieli: | eng |
| Tiivistelmä: | In this paper the shortest path problem in a time depending transit network is discussed. A usual approach in public transport is to compute the shortest path for every possible starting time separately by the use of a modified Dijkstra procedure. Here a label correcting method is used to calculate the desired transit function for all starting times with one path search procedure. The methods discussed in the general theory of algebraic path problems are not efficient for the case that we only want to have the transit function between two specific vertices. |
« edellinen | seuraava »
SCIMA