assignment 17

Determining the minimum path through a network is a fundamental task in travel demand forecasting. We see that to compute the trip interchanges between productions and attractions between zones, we need to know the travel time between all zones. For a small network, we can compute the path times easily. However, for a large network, this process becomes more difficult. We need to develop an automated procedure to accomplish this task.

Consider an example network as shown below. The nodes are labeled, and the link travel times are shown.

Your assignment is to develop an automated procedure to determine the shortest time path from zone x to zone e.

Step 1: Use the method described by Jim Banks to find the minimum time path (including the nodes and links that constitute this path) from zone x to zone e.

Step 2: Develop an algorithm in pseudo-code format that generalizes the approach that you used in step 1. Use comments in your pseudo-code that explains each step. (Please note that you will use this pseudo-code to develop an automated procedure in Excel using Visual Basic procedures).

Be ready to discuss the results of your work in class on Wednesday, November 28^th.