COURSE UNIT TITLE

: TRANSPORTATION SYSTEMS MODELING

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CIE 5067 TRANSPORTATION SYSTEMS MODELING ELECTIVE 3 0 0 7

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR UMAY ZEYNEP UZUNOĞLU KOÇER

Offered to

TRANSPORTATION ENGINEERING
TRANSPORTATION ENGINEERING

Course Objective

It is aimed to provide knowledge about the linear programming methods used for traffic engineering and transportation planning applications. The principles of the problem description and basic information about the solution algorithm are also focused. The problems will be explained by using some numerical examples.

Learning Outcomes of the Course Unit

1   To relate transportations system models with linear programming methods
2   To design objective functions and constraints for a specific problem
3   To formulate transport network components as linear programming variables
4   To describe basic hypothesis intended to model traffic flow
5   To relate statistical network systems with transportation systems
6   To investigate, to apply and to present some examples of transportation system problems by using linear programming methods

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction, introduction to transportation systems modeling, the use of linear programming methods in transportation engineering
2 Modeling, variables, objective function, constraints
3 Transport problem, base solution, optimum solution Homework assignment
4 Simplex Method
5 Graph Theory, introduction to Graph Theory, optimum path research
6 Graph Theory (cont.), transport network model, Ford-Fulkerson algorithm
7 Allocation problem, choice (cost) matrice,
8 satisfaction matrice, König Algorithm
9 Departures in flow, fundamental hypothesis for considering the regulation of departing flows, expected travel distances, expected travel times, extensions, empirical analysis
10 Travel distances on networks, shortest paths between a specific origin and all other destination pairs, shortest paths between all origin and all destination pairs, traffic assignment problem, complexity in urban travel, algorithms
11 Application examples for network models, minimum spanning-tree problem, route problems, suitable location problems
12 Statistical network problems, descriptions, characteristics of statistical networks, discrete and finite case spaces for statistical networks, facility locations in statistical networks
13 Home-work presentations
14 Home-work presentations

Recomended or Required Reading

Textbook(s):
LARSON, R.; ODONI, A.R., (1999) Urban Operation Research , Massachusetts Institute of Technology.
Supplementary Book(s):
CURCHMAN, C.W.; ACKOFF, R.L.; ARNOFF, E.L. (1990): Introduction to Operations Research
ORTUZAR, J.D.; WILLUMSEN, L.G. (1993): Modelling Transport , John Wiley & Sons, West Sussex, England
WINSTON W.L. (1994): Operations Research- Applications and Algorithms , Duxbury Press, California, USA.
Materials: Course presentations.

Planned Learning Activities and Teaching Methods

Course presentations, applications, home-works, home-work presentations.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 PRS PRESENTATION
2 PAR PARTICIPATION
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE PRS * 0.40 + PAR * 0.10 + FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) PRS * 0.40 + PAR * 0.10 + RST * 0.50


Further Notes About Assessment Methods

None

Assessment Criteria

LO 1, 3, 4 ve 5 will be evaluated by using mid-term and final exams.
LO 2 and 6 will be evaluated by using home-works and presentations.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Asst.Prof.Dr. Umay Zeynep UZUNOĞLU KOÇER (umay.uzunoglu@deu.edu.tr)

Office Hours

It will be announced when the course schedule of the faculty is determined.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 12 3 36
Preparations before/after weekly lectures 12 4 48
Preparation for final exam 1 5 5
Preparing assignments 2 30 60
Preparing presentations 2 15 30
Final 1 2 2
TOTAL WORKLOAD (hours) 181

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11
LO.15454
LO.2443345
LO.3534
LO.4443
LO.534534
LO.653534

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS