原文传递
COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS.
| 题名： | COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS. |
| 作者： | Chabini-I |
| 关键词： | Departure-time; Implementation-; Links-Networks; Networks-; Nodes-Networks; Running-time; Shortest-path-algorithms; Travel-time |
| 摘要： | The problem of computing minimum-time paths from all nodes to one destination node, for all possible departure times, in continuous-time dynamic networks with piecewise linear link travel-time functions is considered. Two types of algorithms to solve this problem are presented: a continuous-time label-correcting algorithm and an algorithm that determines optimal minimum travel-time functions in decreasing order of departure times. The algorithms are valid in networks in which "first in, first out" hold and does not necessarily hold. Computer implementations of these algorithms were developed and are available. It is demonstrated that the algorithms have modest computational time and memory requirements. The decreasing order of time algorithm generally requires less running time than the label-correcting algorithm, which is comparatively easier to implement. |
| 总页数： | Transportation Research Record. 2001. (1771) pp1-8 (8 Fig., 11 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS.
- BIT-STREAM REPRESENTATION OF TIME-DEPENDENT DATA : APPLICATIONS TO DATA COMMUNICATION AND PROCESSING.
- BITWISE ALGORITHM FOR FASTEST PATHS IN TIME-DEPENDENT NETWORKS.
- DYNAMIC FREEWAY TRAVEL-TIME PREDICTION WITH PROBE VEHICLE DATA: LINK BASED VERSUS PATH BASED.
- Discrete Dynamic Shortest Path Problems in Transportation Applications Complexity and Algorithms with Optimal Run Time
- Least expected time paths in stochastic, time-varying transportation networks
检索历史
应用推荐
