原文传递
BITWISE ALGORITHM FOR FASTEST PATHS IN TIME-DEPENDENT NETWORKS.
| 题名： | BITWISE ALGORITHM FOR FASTEST PATHS IN TIME-DEPENDENT NETWORKS. |
| 作者： | Chabini-I; Yadappanavar-V |
| 关键词： | Algorithms-; Bit-streams; Dynamic-networks; Links-Networks; Shortest-path-algorithms; Time-dependence; Travel-time |
| 摘要： | An algorithm operating on a new and compact representation of link exit times to solve the one-to-all fastest path problem in dynamic networks is presented. The new space-efficient representation that exploits the first-in, first-out property of link travel times in dynamic networks is developed. The algorithm is described, and its working on a simple network is presented. The algorithm directly operates on bit streams of data representing time-dependent link travel times and performs logical operations on 0 and 1 bits only. computational results are presented for large dynamic networks. The ideas behind the development of this algorithm are extendable to the development of algorithms operating at the bit level to solve other variants of dynamic shortest path problems and other dynamic network flow problems. These developments then open new research possibilities in the development of solution algorithms for dynamic network problems. |
| 总页数： | Transportation Research Record. 2001. (1771) pp201-208 (9 Fig., 1 Tab., 16 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- BEST ROUTING POLICY PROBLEM IN STOCHASTIC TIME-DEPENDENT NETWORKS.
- Robust Routing for Hazardous Materials Transportation with Conditional Value-at-Risk on Time-Dependent Networks.
- Robust Routing for Hazardous Materials Transportation with Conditional Value-at-Risk on Time-Dependent Networks.
- Network Modeling, 2005.
- Discrete Dynamic Shortest Path Problems in Transportation Applications Complexity and Algorithms with Optimal Run Time
- Network Modeling, 2005. Transportation research record.
检索历史
应用推荐
