原文传递
MIDBLOCK CODING OF TRANSPORTATION NETWORKS.
| 题名： | MIDBLOCK CODING OF TRANSPORTATION NETWORKS. |
| 作者： | Blumentritt-CW; Rilett-LR; Park-D |
| 关键词： | MIDBLOCK-; CODING-; TRANSPORTATION-NETWORKS; LINKS-; NODES-; TURNING-TRAFFIC; ALGORITHMS-; MAPS-; ROUTING- |
| 摘要： | This paper discusses the concept of midblock coding of transportation networks. Traditionally, transportation networks are coded in a link-node relationship, where a link represents a directional roadway segment from junction point to junction point. Correspondingly, a node is a branch point that represents the roadway junction, such as a street intersection. Midblock coding places the network branch points between roadway junctions. The links, then, no longer represent roadway segments, but rather represent traffic movements: left turn, straight through, right turn, and U-turn. The nodes, or branch points, are in effect network sources and sinks on the block face. The advantage is that traffic sources and sinks are at midblock, which is a better representation of actual field conditions, since trips originate and terminate at block faces. Also, the method of representing turning movements is simplified, because each turning movement is a link. Finally, intersection delay is incorporated in the link travel time, which is a further simplification. The topological features of the network are more straightforward, because a prohibited turn movement is merely a missing link. Many more links are involved in the network coding and, depending on the application, this may be a disadvantage. In-vehicle routing techniques demand that the roadway network be accurately characterized by the network coding. Any simplification of the coding process can result in much greater accuracy of the network, as well as the determined routes. This paper explores the concept of midblock coding and compares midblock to traditional coding. An algorithm is given for automatically converting from midblock coding to traditional coding. Finally, network search algorithms are compared using both network coding schemes. An additional level of detail is introduced and designated as crown coding. All codings have respective advantages and disadvantages. Different applications require different coding. Map displays use traditional coding, while routing uses midblock coding, and mathematical modeling uses crown coding. |
| 总页数： | Conference Title: Intelligent Transportation: Realizing the Future. Abstracts of the Third World Congress on Intelligent Transport Systems. Location: Orlando, Florida. Sponsored by: ITS America. Held: 19961014-19961018. 1996. pp272 |
| 报告类型： | 科技报告 |
相关文献
- DBCENTRAI.IZBD Algorithms FOR THE MXNAOEHENT AND CCMJTROIi OF TRANSPORTATION SYSTEMS
- Development of a Prototype Master Network System for FSUTMS. Final rept.
- Homeland Security for Rural Transportation Networks.
- Implementing Transportation Knowledge Networks.
- Network Modeling 2012: Volume 2. Transportation Research Record: Journal of the Transportation Research Board, No. 2284.
- Network Modeling 2012: Volume 2. Transportation Research Record: Journal of the Transportation Research Board, No. 2284.
检索历史
应用推荐
