CIVILEN 7740
Transcript Abbreviation:
Urb Transp Netwks
Course Description:
Various networks concepts and applications in transportation, with emphasis on equilibrium-based traffic assignment.
Course Levels:
Graduate
Designation:
Elective
General Education Course
(N/A)
Cross-Listings
(N/A)
Credit Hours (Minimum if “Range”selected):
4.00
Max Credit Hours:
4.00
Select if Repeatable:
Off
Maximum Repeatable Credits
(N/A)
Total Completions Allowed
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes:
In Person (75-100% campus; 0-24% online)
Prerequisites and Co-requisites:
Prereq: 5700, CRPlan 5700, or permission of instructor.
Electronically Enforced:
No
Exclusions:
Not open to students with credit for 874.
Course Goals / Objectives:
Understand principles of user equilibrium and system optimal traffic assignment
Understand the principles of static, deterministic network traffic assignment
Become skilled in mathematics of shortest path algorithms and multiple traffic assignment algorithms
Understand computer implementations of shortest path and traffic assignment algorithms
Model various transportation problems as shortest path problems
Understand issues of algorithmic complexity
Understand concepts of dynamic and stochastic network assignment
Gain experience in using commercial software to solve shortest path and traffic assignment problems
Gain experience in communicating results through effective written reports
Check if concurrence sought:
No
Contact Hours:
| Topic | LEC | REC | LAB | LAB Inst |
|---|---|---|---|---|
| Traffic assignment: inputs, concepts, uses | 3.0 | 0.0 | 0.0 | 0 |
| Network terminology and concepts; coding inputs | 3.0 | 0.0 | 0.0 | 0 |
| Heuristic network traffic assignment algorithms | 4.0 | 0.0 | 0.0 | 0 |
| Shortest paths:traditional and nontraditional applictions; algorithms and algorithmic complexity; computer codes and applications | 10.0 | 0.0 | 0.0 | 0 |
| Constrained minimization concepts: Single and multivariate minimization; first and second order conditions | 10.0 | 0.0 | 0.0 | 0 |
| Constrained minimization algorithms | 10.0 | 0.0 | 0.0 | 0 |
| User equilibrium and system optimal network traffic assignment: Formulations and proofs of equivalence; interpretations of dual variables; algorithms; computer codes and applications | 12.0 | 0.0 | 0.0 | 0 |
| Introduction to stochastic and dynamic traffic assignment. | 4.0 | 0.0 | 0.0 | 0 |
| Total | 56 | 0 | 0 | 0 |
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| Aggregate assignments | 35% |
| Exam 1 | 30% |
| Exam 2 | 25% |
| Classroom participation | 10% |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods | Y. Sheffi | |
| Urban Operations Research | R. Larson and A. Odoni |
ABET-CAC Criterion 3 Outcomes
(N/A)
ABET-ETAC Criterion 3 Outcomes
(N/A)
ABET-EAC Criterion 3 Outcomes
(N/A)
Embedded Literacies Info
(N/A)
Attachments
(N/A)
Additional Notes or Comments
(N/A)