Differences between revisions 60 and 85 (spanning 25 versions)

Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2011

The course is given by Prof. Dr. Hannah Bast and takes place every Friday from 2:15pm until about 3:45pm, in room 00-026 (µ-Saal) in building 101. The first lecture is on Friday, May 6 and the last lecture is on Friday, August 5. There will be no lecture on the following dates: Friday, May 27 (FAM-workshop) and Friday, June 17 (pentecost holidays). That is 12 lectures altogether.

The teaching assistant for this course is Mirko Brodesser (brodessm@informatik.uni-freiburg.de). The responsibles for the supporting systems (Daphne, SVN, Forum, Jenkins) are Jens Hoffmann (hoffmaje@informatik.uni-freiburg.de) and Axel Lehmann (lehmanna@informatik.uni-freiburg.de).

Important Links

Here is the link to Daphne (points and links to your SVN and Jenkins).
Here is the link to the forum (for annoucements and questions).

Lectures and Exercise Sheets

Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): Recording as WMV, Recording as MP4, Slides, Exercise Sheet 1, Master solutions, Table Road Types <-> Speeds, Table with your experimental results.
Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): Recording (AVI, uncut), Slides, no new exercise sheet for this lecture, Coding-standards.
Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): Recording as WMV, Recording as MP4, Slides, Exercise Sheet 2, A* with Landmarks paper.
Lecture 4, Friday, June 3 2011 (Arc flags): Recording (AVI), Slides, Exercise Sheet 3, Code from the lecture, Table Dijkstra & Arc flags, Arc flags papers.
Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): Recording (AVI), Slides, Exercise Sheet 4, Code from the lecture, Google Maps JavaScript API.
Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): Recording (AVI), Slides, Exercise Sheet 5, Contraction Hierarchies paper.
Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice, exam info I): Recording (AVI), Slides, no new exercise sheet for this lecture, Code from the lecture, Results of contraction hierarchies experiments.
Lecture 8, Friday, July 8, 2011 (Transit Node Routing): Recording as WMV, Recording as MP4, Slides, Exercise Sheet 6, Transit Node Routing paper, Results of transit node routing experiments.
Lecture 9, Friday, July 15, 2011 (Transit networks, GTFS): Recording as WMV, Slides, Exercise Sheet 7, Code from the lecture (CsvParser), Results of transit network experiments.
Lecture 10, Friday, July 22, 2011 (Transit networks again, multi-label Dijkstra): Slides, no new exercise sheet for this lecture.

-  ⇤ ← Revision 60 as of 2011-07-02 12:27:21 → 
  Size: 4433
  Editor: Hannah Bast
  Comment:
+   ← Revision 85 as of 2011-07-21 19:47:44 → ⇥
  Size: 6505
  Editor: Hannah Bast
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 14:
- * Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.wmv|Recording (WMV)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Master solutions]], [[EfficientRoutePlanningSS2011/RoadTypesAndSpeeds|Table Road Types <-> Speeds]], [[EfficientRoutePlanningSS2011/Experiments|Table with your experimental results]].
 * Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-2.avi|Recording (AVI, uncut)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-2.pdf|Slides]], ''No exercise sheet for this lecture'', [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures/lecture-2|Files from the lecture]].
 * Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-3.wmv|Recording (WMV)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-3.pdf|Slides]], [[attachment:exercise-sheet-2.pdf|Exercise Sheet 2]].
 * Lecture 4, Friday, June 3 2011 (Arc flags): [[attachment:EfficientRoutePlanningSS2011/lecture-4.avi|Recording (AVI)]], [[attachment:lecture-4.pdf|Slides]], [[attachment:exercise-sheet-3.pdf|Exercise Sheet 3]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Code from the lecture]], [[EfficientRoutePlanningSS2011/Experiments2|Table Dijkstra & Arc flags]]
 * Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-4.pdf|Exercise Sheet 4]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]].
 * Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-5.pdf|Exercise Sheet 5]], [[http://algo2.iti.kit.edu/schultes/hwy/contract.pdf|Contraction Hierarchies article]].
 * Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.pdf|Slides]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]].
+ * Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.wmv|Recording as WMV]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.mp4|Recording as MP4]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Master solutions]], [[EfficientRoutePlanningSS2011/RoadTypesAndSpeeds|Table Road Types <-> Speeds]], [[EfficientRoutePlanningSS2011/Experiments|Table with your experimental results]].
 * Lecture 2, Friday, May 13 2011 (Implementation advice, Build, Test, Style): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-2.avi|Recording (AVI, uncut)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-2.pdf|Slides]], ''no new exercise sheet for this lecture'', [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/coding-standards|Coding-standards]].
 * Lecture 3, Friday, May 20 2011 (A* with Landmarks, Correctness proofs): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-3.wmv|Recording  as WMV]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011//lecture-3.mp4|Recording as MP4]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-3.pdf|Slides]], [[attachment:exercise-sheet-2.pdf|Exercise Sheet 2]], [[http://www.avglab.com/andrew/pub/soda05.pdf|A* with Landmarks paper]].
 * Lecture 4, Friday, June 3 2011 (Arc flags): [[attachment:EfficientRoutePlanningSS2011/lecture-4.avi|Recording (AVI)]], [[attachment:lecture-4.pdf|Slides]], [[attachment:exercise-sheet-3.pdf|Exercise Sheet 3]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/master-solutions/exercise-sheet-1|Code from the lecture]], [[EfficientRoutePlanningSS2011/Experiments2|Table Dijkstra & Arc flags]], [[ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-042-2004.pdf|Arc flags papers]].
 * Lecture 5, Friday, June 11 2011 (Web application, Google Maps API): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-5.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-4.pdf|Exercise Sheet 4]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]], [[http://code.google.com/apis/maps/documentation/javascript|Google Maps JavaScript API]].
 * Lecture 6, Friday, June 24 2011 (Highway & Contraction Hierarchies): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-6.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-5.pdf|Exercise Sheet 5]], [[http://algo2.iti.kit.edu/schultes/hwy/contract.pdf|Contraction Hierarchies paper]].
 * Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice, exam info I): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.avi|Recording (AVI)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-7.pdf|Slides]], ''no new exercise sheet for this lecture'', [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture]], [[EfficientRoutePlanningSS2011/Experiments3|Results of contraction hierarchies experiments]].
 * Lecture 8, Friday, July 8, 2011 (Transit Node Routing): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-8.wmv|Recording as WMV]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-8.mp4|Recording as MP4]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-8.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-6.pdf|Exercise Sheet 6]], [[http://www.mpi-inf.mpg.de/~bast/papers/transit-dimacs.pdf|Transit Node Routing paper]], [[EfficientRoutePlanningSS2011/Experiments4|Results of transit node routing experiments]].
 * Lecture 9, Friday, July 15, 2011 (Transit networks, GTFS): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-9.wmv|Recording as WMV]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-9.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-7.pdf|Exercise Sheet 7]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2011/lectures|Code from the lecture (CsvParser)]], [[EfficientRoutePlanningSS2011/Experiments5|Results of transit network experiments]].
 * Lecture 10, Friday, July 22, 2011 (Transit networks again, multi-label Dijkstra): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-10.pdf|Slides]], ''no new exercise sheet for this lecture''.