1. 4-step Model – Trip Assignment 1CVEN672 Lecture 13-1

2. CVEN6722 Trip Assignment Definition Assign T ij onto alternative routes on the network to predict the Link flows and to evaluate the network performance.

3. CVEN6723 Trip Assignment Generalized Cost = function of time, distance, $$ + possibly others. From the user’s perspective; shortest path (stochastic vs. deterministic)  UE From the planner’s perspective: minimize the network wide travel cost  SO i j

4. CVEN6724 Trip Assignment: Link Performance Fucntion Each path has an associated Link performance function (LPF): Typical forms: t = t 0 e V/C t = t 0   (V/C) Most common from the Bureau of Public Roads (BPR) t = t 0 (1 + a(V/C) b ) which becomes when linear (b = 1, a =  C/t 0 ): t = t 0 +  V

5. CVEN6725 Trip Assignment Four classes of TA methods : 1.ALL-or-NOTHING Assignment for uncongested network (constant cost) [Dijkstra: Shortest path algorithm] find the shortest path and assign all travels on the SP between a pair of OD. 2.User Equilibrium (Wardrop principles) Every traveler is on the shortest path to the destination. No user can be better off by unilaterally changing to a different route. 3.Stochastic TA (due to “perceived” costs, lack of info for users) Users do not have perfect real time information about cost. Their route choice decisions have uncertain factor. 4.Dynamic assignment (how about time variable???) Traffic do not happen on the roads at one single instance of time. Early travel decisions have impact on later traffic congestions. The interactions over time are considered.

6. CVEN6726 Shortest Path (Dijkstra) Assuming a known network with a known deterministic link performance, the objective is to find a path from an origin to a destination at the least cost. Shortest path calculations are idealistic, but are most fundamental to the network flow problem and to the network traffic assignment problem. Many sophisticated algorithms are built with the shortest path algorithm. There are many variations (Dijkstra, Moore), but all get to the same results. The complexities are different slightly.

7. Notations NSet of nodes M set of unlabeled notes Bar(M) set of unlabeled nodes n i ith node in consideration C(n i,n j ) cost of travel from node i to node j. C(n j ) cost of travel from the home node to node j. CVEN6727

8. 8 Shortest Path (Dijkstra)

9. CVEN6729 Label L(n i ) = [predecessor, cost] This is the algorithm to summarize based on the example

10. CVEN67210 Shortest Path (Dijkstra)

11. DIJKSTRA’S ALGORITHM Greedy Algorithm – Greedy algorithms use problem solving methods based on actions to see if there’s a better long term strategy. Dijkstra’s algorithm uses the greedy approach to solve the single source shortest problem. It repeatedly selects from the unselected vertices, vertex v nearest to source s and declares the distance to be the actual shortest distance from s to v. The edges of v are then checked to see if their destination can be reached by v followed by the relevant outgoing edges. Disadvantages – The major disadvantage of the algorithm is the fact that it does a blind search there by consuming a lot of time waste of necessary resources. – Another disadvantage is that it cannot handle negative edges. This leads to acyclic graphs and most often cannot obtain the right shortest path. 11CVEN672

12. Exercise: find the shortest path from A  E 12CVEN672

13. 13 All-or-nothing Assignment, use Dijkstra to find S.P. for each O/D pair and then assign all flow to it A-C = 400; A-D = 200; B-C = 300; B-D = 100

14. Some math background to the Dijkastra’s Algorithm (optional) Linear programming – LP to inset later Dual program 14CVEN672 d_o