返回Google圖書搜尋

Temporal Shortest Paths : Parallel Computing Implementations

Michael FlorianNicolas TremblayCentre for Research on Transportation (Montréal, Québec)

出版	Centre for Research on Transportation = Centre de recherche sur les transports (C.R.T.), 2000
URL	http://books.google.com.hk/books?id=VhdENAEACAAJ&hl=&source=gbs_api

註釋The computation of temporal (or dynamic) shortest paths is of particular importance in the development of management & control measures of transportation networks. This paper explores 2 types of parallel computing implementations for 3 algorithms for computing temporal shortest paths. It introduces the required notation & presents the 3 temporal shortest path algorithms. Section 3 is dedicated to the description of the parallel implementations and the computational results are presented in section 4. Finally, the document offers conclusions.