Transport-, Routering- and Scheduling Problems (WI4
062TU, 2010)
Docent: C.Roos/ Ir.
H.N. Post (tel. 06 5134 2256)
Content:
Nowadays
everybody is familiar with navigation systems in cars. Did you ever ask how to
find the fastest route? This is the subject of the first course.
Other problems that we will be considered are: How to find the shortest route
along all mailboxes in a town? Given a set of mines and factories, each with
given capacity, how can the transport from the mines to the factories organized
in the cheapest way? I this course we not only consider exact solution methods,
but also many approximation (heuristic) methods. These methods will
demonstrated by examples from practice, mainly in the world of transportation.
Elementary knowledge of graph theory is desired, though not necessary.
Time and place: Monday from
15:45 to 17:30 in room TH-Classroom 10 (A272), starting on February 1.
Course
material
- Handouts:
2004 tspexample.
- Course
notes
- Sheets
Shortest path problem,
Transportation problem,
Traveling Salesman problem,
Vehicle routing problem,
Production scheduling,
Demo RBS. - Chapter VRP
- Chapter Job
scheduling
Exam: Written
Interesting links
Mail
me at
Page started: May 3, 1999