線構造をもつネットワーク上の最適順路問題

概要

論文の詳細を見る
A network with line structures, called line network, is defined as a hypergraph each edge of which forms a totally ordered set of nodes. Many objects concerning transportation networks such as railroad networks, train or bus route networks, road networks, train diagrams, etc. can be represented naturally by line networks. An algorithm for the shortest paths on a line network is Presented. This algorithm is an extended version of Bellman'shortest path algorithm. Minimum time traveling problem on a train diagram is treated as an application of line network and of the shortest path algorithm on it. Moreover, the algorithm is extended so as to serve the problem of obtaining the minimum cost relaying schedules among trains.
一般社団法人情報処理学会の論文
1978-03-15