Search programme

​Use the search function to search amongst programmes at Chalmers. The programme overview and the programme syllabus relating to your studies are generally from the academic year you began your studies.

​​​

Syllabus for

Academic year
TDA316 - Transport optimization
 
Owner: TM
5,0 Credits (ECTS 7,5)
Grading: TH - Five, Four, Three, Not passed
Level: A
Department: 0701 - Datavetenskap DI CTH/GU


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0101 Examination 5,0 c Grading: TH   5,0 c    

In programs

TM Teknisk matematik, Year 2 (elective)
EMMAS MSc PROGR IN ENGINEERING MATHEMATICS, Year 1 (elective)
TAUTA AUTOMATION AND MECHATRONICS ENGENEERING, Year 4 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING - Algorithms, Year 4 (elective)

Examiner:




Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Course specific prerequisites

A basic course in either Optimization, Operational Research or Algorithms

Aim

The course is intended for anyone with an interest in transport optimization and/or with a general interest in optimization and algorithms. It explains how mathematical and algorithmic methods can be used to solve different kinds of transport optimization problems. Such solutions can give major savings in time, costs and other resources. The course has a mathematical character but emphasizes the solution of practical problems where an important part is the participation of leading exter-nal experts in the area.

Content

The course consists of the following main parts:
Introduction to optimization and algorithms. Com-mon discrete problems and algorithm design tech-niques. Basic optimization concepts, linear and integer linear programming.
Classical/fundamental transport optimization prob-lems. Modelling issues. Good and bad formula-tions.
Traffic planning: optimization of road networks. The traffic planning context and process. Integrated models versus the four-step procedure. Behavioural modelling. Modern applications. Traffic mana-gement models. The traffic equilibrium problem. Wardrop's principles of system optimum and user equilibrium. The Frank-Wolfe method. Braess' paradox. Asymmetric models. Case study.
Route optimization. The Traveling Salesman Problem (TSP).
The Vehicle Routing Problem (VRP). Variations such at time windows, several depots, pickup/-delivery etc. General techniques for solving route optimization problems. Network flow models and other special cases. Multicommodity flow. Con- struction heuristics and local search. Column generation. Case studies.
Airline scheduling. Overview of the airline planning process. Aircraft scheduling. Crew pairing. Crew assignment. Advanced column generation with resources and k-shortest path for the generation subproblem. Extensive case studies.
If time allows there will be additional guess lectures on selected topics. Timetable optimization. Facility location.
Several of the lectures will be given by experts in each respective field. To keep the course together there will be a weekly exercise session with a possibility to discuss the current topics and to help out with the assignments.
The examination for the course consists of a number of assignments, one for each main topic plus a final literature study. All assignments are to be handed in individually.
For the most up to date information see the course home page.

Literature

Collection of scientific papers and lecture notes

Examination

Passed course assignments.


Page manager Published: Thu 03 Nov 2022.