GEOGRAPHIC INFORMATION SCIENCE NETWORK MODELING

GISC 7362
SYLLABUS
FALL 2005

Professor: Kevin M. Curtin

Email: curtin@utdallas.edu
Office: GR 3.209
Office Hours: Tuesday 3pm – 6pm or by Appointment
Office Phone: (972) 883-6237
Home Page: www.utdallas.edu/~curtin
Class Location: GR 3.602
Class Meetings: Wednesdays 7-9:45pm

Goals and Objectives:

This class is designed to introduce you to the theory and applications of Network Modeling for
Geographic Information Systems. You will learn the basics of networks, including definitions,
measures, and indices of networks. You will learn the ways in which networks are modeled in
GIS including the various topological structures. You will learn how to compute the shortest
path across networks and how to define flow across networks. You will learn how to modify
networks using Linear Referencing and Route Events, and you will learn how to structure and
solve some of the most common problems in Transportation Geography.

Readings:
There is no assigned textbook for this class. Individual readings will be distributed in class.

Grading:
Lab Assignments (5) 50 points each 250
Mid-Term Exam (1) 200 points 200
Final Project (1) 250 points 250
Second Exam (1) 300 points 300
Total Possible Points: 1000 points

Make-up Exams:
The Mid-Term and Final Exams may be made-up by taking an essay exam within one
week of the exam date. There will be 3 essays covering the course material.

Late Assignments:
Assignments are due by the start of class on the specified due date. Assignments are
accepted up to 4 days late. Each day late incurs a 10 point penalty.

Any suspected instances of Academic Dishonesty will be referred to the Dean of Students.
 DAILY SCHEDULE
DATE THEORY GIS PRACTICE FINAL PROJECT ASSIGNMENTS
08/24/0 Define Terms Introduction;
What makes a good project?
5 Basic Network Measures Syllabus; Class Format
Creating Geometric Networks
08/31/0 Discuss Graph Theory Exercises Editing Networks Reading your titles
Assignment 1 Due
5 Network Models within GIS Weights, Sources, Sinks Doing a literature search
Network Objects
Path Finding within GIS;
09/07/0
Dijkstra’s Shortest Path Algorithm Ancestors, Connected Features, Discuss your proposals
5
Loops, Barriers, and Flags
09/14/0
The K-Shortest Path Algorithm Intro to Network Analyst Review power point presentations Assignment 2 Due
5
09/21/0 Network Analyst Module
Maranzana Heuristic Discuss Methods section
5 Creating Network Data Sets
09/28/0
Network Analyst Functions Midterm Review Assignment 3 Due
5
10/05/0
MIDTERM EXAM
5
10/12/0 Flow Algorithms Go Over Midterm
Flow Algorithms in GIS
5 Minimum Cost, Maximum Flow Project Update Presentations
10/19/0 Traveling Salesman and other
ArcLogistics Route Project discussion
5 Vehicle Routing Problems
The Classic Transportation
10/26/0
Optimization Problem and the Schematic Networks in GIS Review initial results Assignment 4 Due
5
Transportation Simplex Method
11/02/0 Linear Referencing, Dynamic
Linear Referencing in ArcGIS Final power point review
5 Segmentation, Route Events
11/09/0
Urban Travel Demand Modeling Agent Based Modeling Second Exam Review Assignment 5 Due
5
11/16/0 FINAL PROJECT PRESENTATIONS
 5
11/23/0
SECOND EXAM
5