Question One: With respect to the network shown in the Figure below, and assuming that the only demand is between zones 1 and 6, and is equal to 1,600 trips/day. Use the dial algorithm to stochastically assign traffic to the network shown. 5 min 2 5 min 3 min 1 min 3 3 min 5 min 6 3 min 4 min 4 min 5 3 min The link likelihood function is given as: exp{1.0*[r(i)-r(i) ti-> D)]}, if r(i) $(j) (j} j) ss Li-> ]) = 0, otherwise where: r(i) = the expected minimum travel time from the origin node (node 1) to node i; r(j) = the expected minimum travel time from the destination node (node 6) to node ji; t(i+j) = the travel time for link (i+j). Question One: With respect to the network shown in the Figure below, and assuming that the only demand is between zones 1 and 6, and is equal to 1,600 trips/day. Use the dial algorithm to stochastically assign traffic to the network shown. 5 min 2 5 min 3 min 1 min 3 3 min 5 min 6 3 min 4 min 4 min 5 3 min The link likelihood function is given as: exp{1.0*[r(i)-r(i) ti-> D)]}, if r(i) $(j) (j} j) ss Li-> ]) = 0, otherwise where: r(i) = the expected minimum travel time from the origin node (node 1) to node i; r(j) = the expected minimum travel time from the destination node (node 6) to node ji; t(i+j) = the travel time for link (i+j)