The course introduces the basic theories, various modeling techniques, and specific
applications of transportation networks. It is organized in three interrelated parts.
The first part examines the representation, structures, and operations of
transportation networks in a GIS environment. The second part deals with
transportation planning strategies. A large portion of this part is devoted to the
conventional four-stage transportation modeling framework. The third part of the
course focuses on applications of GIS-T in solving location-allocation problems.
There will be weekly laboratories for hands-on exercises with TransCAD, a GIS-T
package, in a computer lab. The labs are closely related to the theories and
techniques discussed in class.


This course meets the following General Education Abilities, by accomplishing the
specific learning objectives listed below:

Communicate effectively through writing.  This is met by a series of writing 
assignments associated with supplemental reading and data analysis.
 
Computer Literacy is addressed through course administration, student-faculty 
electronic interaction, data analysis activities and assignments, and exposure to 
GIS technologies.
 
Critical Thinking is central to the learning objectives of this class, and are 
developed through homework assignments, lecture, classroom discussion, and inquiry-
based learning efforts.

Network representation and properties  (week 1)
GIS-T data models 		       (week 2)
Shortest path and routing              (week 3)
The conventional 4-stage model
Trip generation modeling               (week 4)
Trip Distribution modeling             (week 5)
Model split                            (week 6)
Trip assignment                        (week 7)
Alternative transportation planning approaches
     discrete choice models
     activity pattern analysis
     stated-preference techniques.      (weeks 8 & 9)
Solving location problems with GIS-T        (week 10)
Brief introduction to Linear Programming    (week 11)
P-median problem                            (week 12)
Set covering and maximal covering problems  (week 13)
P-centers problem                           (week 14)
Student presentations                       (week 15)