CE 573 Transportation Planning - Fall 2001

Administration Course materials Other links
week 1 week 2 week 3 week 4
week 5 week 6 week 7 week 8
week 9 week 10 week 11 week 12
week 13 week 14 week 15

Week 13 (November 25-29, 2001)

This week will study continue our study of the travel demand forecasting process.  This week we will focus on one of the most important algorithms used in the process, the minimum path algorithm.  This algorithm permits the efficient computation of the minimum travel time path between two zones, a computation that can be automated easily using Visual Basic.

Follow the links in the table below to class notes, assignments, solutions, questions, and references.

Class notes Assignments Solutions Questions References
30 31 32 17 18   Study questions Readings Web links