论文部分内容阅读
为了解决基于并行系统动态交通分配的网络分割划分问题,该文给出了一种道路网络图区块划分的启发式算法。该算法不同于当前的普适算法,是专门针对交通应用中的道路网络图的特点而设计的,算法首先对矢量网络进行栅格映射,然后通过区块生长方法来满足分割要求。相对于其他算法,该算法能够满足任意指定数量的区块划分要求,分析过程不需反复迭代。因此算法的执行效率很高,并且能够得到理想的划分结果。同时由于所考虑的并行硬件环境是IBM兼容机加局域网的主流平台,算法具有一般性。
In order to solve the problem of network segmentation and partitioning based on dynamic traffic assignment in parallel system, a heuristic algorithm for partitioning road network graph is proposed. This algorithm is different from the current pervasive algorithm and is designed specifically for the characteristics of road network in traffic applications. The algorithm first rasterizes the vector network and then meets the segmentation requirements by the method of block growth. Compared with other algorithms, the algorithm can meet any specified number of block partitioning requirements, and the analysis process does not need iterative iteration. Therefore, the implementation of the algorithm is very efficient, and can get the ideal result of the partition. At the same time as the parallel hardware environment considered is the mainstream platform of IBM compatible LAN and local area network, the algorithm is general.