Information Package / Course Catalogue
Transportation Network Analysis
Course Code: MCE556
Course Type: Area Elective
Couse Group: Second Cycle (Master's Degree)
Education Language: English
Work Placement: N/A
Theory: 3
Prt.: 0
Credit: 3
Lab: 0
ECTS: 8
Objectives of the Course

The objectives of this course are to provide students with a comprehensive understanding of urban transportation networks, transportation assignment models, and algorithms, and enabling them to analyze urban transportation networks.

Course Content

This course covers a range of topics related to urban transportation network analysis and modeling, including the definitions of transportation networks, shortest path algorithms, all-or-nothing and capacity restraint assignment models, deterministic and stochastic user equilibrium, user equilibrium with variable demand, mode choice and trip distribution problems, user equilibrium models with link-flow interactions, joint travel choice models, transit assignment models, and dynamic assignment models.

Name of Lecturer(s)
Lec. Mehmet Metin MUTLU
Learning Outcomes
1.Students will have a solid understanding of urban transportation networks.
2.Students will be able to apply the concepts of deterministic/stochastic and static/dynamic traffic assignment models.
3.Students will gain knowledge in transit assignment models and be able to apply these models.
4.Students will be able to use transportation assignment models in predicting transportation network flows and forecast the effect of network design decisions to transportation system performance.
5.Students will be able to implement the models required by their field of expertise using programming languages, and to program algorithms to evaluate the obtained outputs using numerical and graphical methods.
Recommended or Required Reading
1.Urban Transportation Networks (Sheffi, 1985)
2.Transportation Systems Analysis: Models and Applications (Cascetta, 2009)
Weekly Detailed Course Contents
Week 1 - Theoretical
Urban Transportation Network Fundamentals and Definitions
Week 2 - Theoretical
Network Representation, Shortest Path Algorithms
Week 3 - Theoretical
All-or-Nothing Assignment, Capacity Restraint Assignment models
Week 4 - Theoretical
Deterministic User Equilibrium
Week 5 - Theoretical
User Equilibrium with Variable Demand
Week 6 - Theoretical
User Equilibrium Mode Choice / Assignment Problem
Week 7 - Theoretical
User Equilibrium Trip Distribution / Assignment Problem
Week 8 - Theoretical
User Equilibrium with Link Interactions
Week 9 - Theoretical
Joint Travel Choice Models
Week 10 - Theoretical
Stochastic Network Loading
Week 11 - Theoretical
Stochastic User Equilibrium
Week 12 - Theoretical
Transit Assignment Models
Week 13 - Theoretical
Transit Assignment Models
Week 14 - Theoretical
Dynamic Assignment Models
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%30
Final Examination1%40
Assignment2%30
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory142370
Assignment2201060
Individual Work210122
Midterm Examination120323
Final Examination125328
TOTAL WORKLOAD (hours)203
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
PÇ-12
PÇ-13
OÇ-1
3
4
4
3
3
4
3
4
4
3
3
3
5
OÇ-2
4
5
4
5
5
4
4
5
5
4
4
4
5
OÇ-3
4
5
4
5
5
4
4
5
5
4
4
4
5
OÇ-4
5
5
5
5
5
5
5
5
5
5
4
5
5
OÇ-5
4
5
5
5
5
5
4
5
5
5
3
4
4
Adnan Menderes University - Information Package / Course Catalogue
2026