基于子网连接点分布的分布式交通分配方法

Distributed Traffic Assignment Method Based on Connection-nodes Distribution of Sub-networks

提出多点连接双子网分布式分配的方法,将整网分为具有共同连接点的子网,基于一般交通分布/分配组合模型及其网络变换解法,提出连接点吸引测度的具体度量方法。OD点在不同子网的跨网需求的分配转化为寻找连接点分布,使在该分布下,各子网平衡可达整网平衡。由此,分布式分配转化为2个部分:连接点分布/子网分配组合计算以及基于连接点分布的子网分配。分析表明,在此分布式分配中,各子网既独立完成各自的分配任务又通过在迭代过程中相互传递阻抗信息和连接点分布信息来协同工作,具有分布式系统的优点,而且计算结果表明分布式分配是可行的。

The method of distributed traffic assignment is provided in double sub-networks with multi-connection-nodes. The attraction measure of connection-nodes is estimated based on the general joint traffic distribution/assignment model and its solution by network representation. The assignment problem with origin and destination in different sub-networks can be transformed into searching a connection-nodes distribution which enables that equilibrium of sub-networks lead to that of the whole network.Consequently,the distributed assignment includes two parts：the joint connection-nodes distribution/sub-network assignment and sub-network assignment based on connection-nodes distribution. The sub-networks do their assignment job separately and they cooperate by communicating impedance information and connection-nodes distribution information during iteration. The analysis shows that this logic has the advantages of distributed system and the calculation results indicate the feasibility of distributed assignment.