
WI4062TU: 
Transport, Routing and Scheduling 
ECTS: 
3 
Responsible Instructor: 
Prof.dr.ir. K.I. Aardal 
Instructor: 
Ir. H.N. Post 
Contact Hours / Week x/x/x/x: 
0/0/2/0 
Education Period: 
3 
Start Education: 
3 
Exam Period: 
3, 4 
Course Language: 
English 
Course Contents: 
In this course we deal with combinatorial optimizations methods for the solution of problems that arise when one has to optimally organize transportation of goods, routing of vehicles, production schedules, such as: The shortest path problem, the assignment problem/transportation problem, the travelling salesman problem, the vehicle routing problem, and the job shop scheduling problem. The last lecture is devoted to the demonstration of the successful package RBS that contains several of the algorithms explained during the course. 
Study Goals: 
 The student is able to recognize a problem as a discrete linear optimization problem and is able to provide a mathematical formulation for it.  The student is able to solve the shortest path problem and the transportation problem as well as some small flow shop problems.  The student is able to solve the travelling salesman problem by the Branch and Bound algorithm.  The student knows several heuristic solution methods for the travelling salesman problem and the vehicle routing problem.  The student knows some basic theorems concerning the mentioned problems and is able to prove some of these theorems.  The student has knowledge about methods to solve large scale problems, especially shortest path and vehicle routing problems. 
Education Method: 
Lectures 
Literature and Study Materials: 
Course notes and handouts (made available via Blackboard). 
Assessment: 
Written exam. 
