Next, a different routing of the arcs is obtained by specifying the DP and the HTRACKS= options. As a result of these options, the NETDRAW procedure uses a dynamic programming algorithm to route the ...

Dynamic routing algorithms aim to find the shortest (fastest in most cases) path in a road network prone to timedependent traffic states. Conventional approaches assume the availability of link-level ...