|
Size: 2593
Comment:
|
Size: 9310
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| The course is given by [[http://ad.informatik.uni-freiburg.de/staff/bast|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. | {{{ #!html <a style="color:red" href="http://ad-wiki.informatik.uni-freiburg.de/teaching/InformationRetrievalWS1213/Feedback">Here are the results for the official evaluation of this course.</a> }}} The course was given by [[http://ad.informatik.uni-freiburg.de/staff/bast|Prof. Dr. Hannah Bast]] and took place every Friday from 2:15pm until 3:45pm, in room 00-026 (µ-Saal) in building 101. The first lecture was on Friday, May 6 and the last lecture was on Friday, August 5. There were ''no lectures'' on the following dates: Friday, May 27 (FAM-workshop) and Friday, June 17 (pentecost holidays). That were 12 lectures altogether. |
| Line 5: | Line 10: |
| '''NOTE: Please don't forget to put your average running times from Exercise Sheet 1 in the table linked below!!!''' | The teaching assistant for this course was Mirko Brodesser (brodessm@informatik.uni-freiburg.de). The responsibles for the supporting systems (Daphne, SVN, Forum, Jenkins) were Jens Hoffmann (hoffmaje@informatik.uni-freiburg.de) and Axel Lehmann (lehmanna@informatik.uni-freiburg.de). |
| Line 7: | Line 12: |
| 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). | == Exam == * The '''written exam''' (for the master students) takes place on Monday, August 15, 2011, from 2:00 pm - 3:30 pm in room 00-026 (µ-Saal) in building 101. * The '''Klausureinsicht''' (for the written exam) takes place on Tuesday, August 16, 2011, from 3:00 pm - 4:00 pm in room 02-028, building 51 (office of Prof. Bast). * The '''oral exams''' (for the bachelor students) take place on Wednesday, August 17, 2011 starting from 2:00 pm, 30 minutes each, also in room 02-028, building 51 (office Prof. Bast). You find the exact time slot in your Leistungsübersicht in the Studierendenportal. * There is a dedicated [[http://ad-forum.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2011/viewforum.php?f=18|section on the forum]] for asking questions on the exam. * 15Aug11 11:21pm: we have corrected your exam, [[EfficientRoutePlanningSS2011/Exam|click here for further information]]. |
| Line 11: | Line 22: |
| * Here you can [[https://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2011|register at our course system Daphne]]. * Here is the link to the [[http://stromboli.informatik.uni-freiburg.de/teaching/efficient-route-planning-ss2011/forum/|forum]] (for annoucements and questions). |
* Here is the link to [[https://daphne.informatik.uni-freiburg.de/EfficientRoutePlanningSS2011|Daphne]] (your points and links to your SVN and Jenkins). * Here is the link to the [[http://ad-forum.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2011|Forum]] (for annoucements and questions). * Here is the summary of the [[EfficientRoutePlanningSS2011/Feedback|official evaluation of the course]]. |
| Line 14: | Line 26: |
| == Lectures and Exercise Sheets == | == Lecture Slides, Video Recordings, Exercise Sheets, and Code == |
| Line 16: | Line 28: |
| * Lecture 1, Friday, May 6 2011 (Introduction, Dijkstra, A-Star): [[http://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011/lecture-1.avi|Recording (AVI, uncut)]], [[http://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011/lecture-1.pdf|Slides]], [[http://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011/exercise-sheet-1.pdf|Exercise Sheet 1]], [[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://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011//lecture-2.avi|Recording (AVI, uncut)]], [[http://etna.informatik.uni-freiburg.de/lectures/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://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011/lecture-3.pdf|Slides]], [[http://etna.informatik.uni-freiburg.de/lectures/route-planning-ss2011/exercise-sheet-2.pdf|Exercise Sheet 2]]. |
''Remark about the video recordings:'' we have prepared videos in different formats, in particular: ''.m4v'', ''.mp4'', and ''.wmv''. If you click on one of the links "Video recording" you get that format of which our script thinks that it best fits your device / operating system / browser. If you explicitly want a particular format, simply copy the link address and add the desired extension by hand. * Lecture 1, Friday, May 6, 2011 (Introduction, Dijkstra, A-Star): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=lecture-1|Video recording]], [[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/get-video.php?file=lecture-2|Video recording]], [[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/get-video.php?file=lecture-3|Video recording]], [[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): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=lecture-4|Video recording]], [[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/get-video.php?file=lecture-5|Video recording]], [[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/get-video.php?file=lecture-6|Video recording]], [[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/get-video.php?file=lecture-7|Video recording]], [[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/get-video.php?file=lecture-8|Video recording]], [[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/get-video.php?file=lecture-9|Video recording]], [[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/get-video.php?file=lecture-10|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-10.pdf|Slides]], no new exercise sheet for this lecture. * Lecture 11, Friday, July 29, 2011 (Transfer patterns, course evaluation): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=lecture-11|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-11.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/exercise-sheet-8.pdf|Exercise Sheet 8]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/evaluation-form.pdf|Evaluation Form (PDF)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/evaluation-form.tex|Evaluation Form (Latex source)]], [[http://ad.informatik.uni-freiburg.de/papers/transferpatterns.pdf|Paper]], [[EfficientRoutePlanningSS2011/Experiments6|Results of transfer patterns experiments]]. * Lecture 12, Friday, August 5, 2011 (Course evaluation results, transfer patterns again, exam): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/get-video.php?file=lecture-12|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2011/lecture-12.pdf|Slides]], [[EfficientRoutePlanningSS2011/Feedback|Course evaluation results]]. |
Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2011
Here are the results for the official evaluation of this course.
The course was given by Prof. Dr. Hannah Bast and took place every Friday from 2:15pm until 3:45pm, in room 00-026 (µ-Saal) in building 101. The first lecture was on Friday, May 6 and the last lecture was on Friday, August 5. There were no lectures on the following dates: Friday, May 27 (FAM-workshop) and Friday, June 17 (pentecost holidays). That were 12 lectures altogether.
The teaching assistant for this course was Mirko Brodesser (brodessm@informatik.uni-freiburg.de). The responsibles for the supporting systems (Daphne, SVN, Forum, Jenkins) were Jens Hoffmann (hoffmaje@informatik.uni-freiburg.de) and Axel Lehmann (lehmanna@informatik.uni-freiburg.de).
Exam
The written exam (for the master students) takes place on Monday, August 15, 2011, from 2:00 pm - 3:30 pm in room 00-026 (µ-Saal) in building 101.
The Klausureinsicht (for the written exam) takes place on Tuesday, August 16, 2011, from 3:00 pm - 4:00 pm in room 02-028, building 51 (office of Prof. Bast).
The oral exams (for the bachelor students) take place on Wednesday, August 17, 2011 starting from 2:00 pm, 30 minutes each, also in room 02-028, building 51 (office Prof. Bast). You find the exact time slot in your Leistungsübersicht in the Studierendenportal.
There is a dedicated section on the forum for asking questions on the exam.
15Aug11 11:21pm: we have corrected your exam, click here for further information.
Important Links
Here is the link to Daphne (your points and links to your SVN and Jenkins).
Here is the link to the Forum (for annoucements and questions).
Here is the summary of the official evaluation of the course.
Lecture Slides, Video Recordings, Exercise Sheets, and Code
Remark about the video recordings: we have prepared videos in different formats, in particular: .m4v, .mp4, and .wmv. If you click on one of the links "Video recording" you get that format of which our script thinks that it best fits your device / operating system / browser. If you explicitly want a particular format, simply copy the link address and add the desired extension by hand.
Lecture 1, Friday, May 6, 2011 (Introduction, Dijkstra, A-Star): Video recording, 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): Video recording, Slides, no new exercise sheet for this lecture, Coding-standards.
Lecture 3, Friday, May 20, 2011 (A* with Landmarks, Correctness proofs): Video recording, Slides, Exercise Sheet 2, A* with Landmarks paper.
Lecture 4, Friday, June 3, 2011 (Arc flags): Video recording, 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): Video recording, Slides, Exercise Sheet 4, Code from the lecture, Google Maps JavaScript API.
Lecture 6, Friday, June 24, 2011 (Highway & Contraction Hierarchies): Video recording, Slides, Exercise Sheet 5, Contraction Hierarchies paper.
Lecture 7, Friday, July 1, 2011 (Contraction Hierarchies again, implementation advice, exam info I): Video recording, 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): Video recording, Slides, Exercise Sheet 6, Transit Node Routing paper, Results of transit node routing experiments.
Lecture 9, Friday, July 15, 2011 (Transit networks, GTFS): Video recording, 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): Video recording, Slides, no new exercise sheet for this lecture.
Lecture 11, Friday, July 29, 2011 (Transfer patterns, course evaluation): Video recording, Slides, Exercise Sheet 8, Evaluation Form (PDF), Evaluation Form (Latex source), Paper, Results of transfer patterns experiments.
Lecture 12, Friday, August 5, 2011 (Course evaluation results, transfer patterns again, exam): Video recording, Slides, Course evaluation results.