道路网络图的区块划分算法

为了解决基于并行系统动态交通分配的网络分割划分问题,该文给出了一种道路网络图区块划分的启发式算法。该算法不同于当前的普适算法,是专门针对交通应用中的道路网络图的特点而设计的,算法首先对矢量网络进行栅格映射,然后通过区块生长方法来满足分割要求。相对于其他算法,该算法能够满足任意指定数量的区块划分要求,分析过程不需反复迭代。因此算法的执行效率很高,并且能够得到理想的划分结果。同时由于所考虑的并行硬件环境是IBM兼容机加局域网的主流平台,算法具有一般性。

Algorithm for road network graph partitioning

A heuristic algorithm was developed for network graph partitioning based on a parallel system dynamic traffic assignment methodology.Unlike current algorithms, this algorithm is specially designed for road networks in transportation systems.The road grid is first mapped onto a vector network,then a growth method is used for the network partitioning.Compared with current algorithm,the algorithm allows graph partitioning of any size system without repeated iterations.Thus,the algorithm is efficient and gives ...