交通系统规划与控制教学（清华大学）Homework 4 of Transportation Systems Analysis.pdfVIP

Homework 4 of Transportation Systems Analysis Chiwei Yan 200801893 1. Shortest Paths Algorithms and Assignment on Uncongested Network In this section, a modified Static Dijkstra Shortest Paths (SSP) will be firstly established for determining all-to-one shortest paths on a given network, and moreover, other modification will be made on the one-to-one SSP in order to find a good efficiency. Then we will assign an All-or-Nothing OD flow according to the result of SSP. Finally, we will proof that using the former result of the all-to-one SPT(shortest path tree) to other nodes can help accelerate the computation speed of the all-to-one SPT to a specific node. 1.1 Compute the all-to-one SPT to node a, and draw the SPT Figure 1 Given network We denote , - as the current known shortest distance from node i to destination a, and we denote , - as the immediate successor on the shortest paths. Finally, a field called label indicates whether a node is permanently labeled or not. STEP 0: Initialization , - , - We set * + , - STEP 1: Main Loop (1) Figure 2 Main Loop(1) We firstly update the distance matrices (d[]) by searching the nodes which directly link to node a, if the distance value is lower than the former one, then we update the value in d[]. a b c d e f g h i j d[](former) d[](updated) 6 3 7 Since node c has the smallest distance value among all t he unlabeled nodes, we