4282
Comment:
|
← Revision 115 as of 2023-11-30 00:47:37 ⇥
13928
|
Deletions are marked like this. | Additions are marked like this. |
Line 5: | Line 5: |
The course is given by [[http://ad.informatik.uni-freiburg.de/staff/bast|Prof. Dr. Hannah Bast]] and takes place every Wednesday from 4:15pm until 5:45pm, in seminar room 01-009/13 in building 101. The first lecture is on Wednesday, April 25, 2012 and the last lecture is on Wednesday, July 25, 2012. There will be ''no lecture'' on Wednesday, May 30, 2012 (pentecost holidays). That is 13 lectures altogether. | {{{ #!html <a style="color:darkred" href="http://ad-wiki.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2012/Exam">Here is all the information about the exam.</a> }}} |
Line 7: | Line 10: |
The tutors for this course are Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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). | {{{ #!html <a style="color:darkred" href="http://ad-wiki.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2012/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 Wednesday from 4:15pm until 5:45pm, in seminar room 01-009/13 in building 101. The first lecture was on Wednesday, April 25, 2012 and the last lecture was on Wednesday, July 25, 2012. There was be ''no lecture'' on Wednesday, May 30, 2012 (pentecost holidays). That was 13 lectures altogether. The tutors for this course were Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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). {{{ #!html <!-- <h2 style="color:red">Maintenance</h2> <p>All Daphne Services (SVN/Jenkins/...) will not be available for some time on Thursday 17. Mai and Friday 18. Mai. We apologize for any inconvenience.</p> <h2 style="color:red">NO LECTURE TODAY, on Wednesday June 20, at 4:15pm ... Prof. Bast is sick.</h2> --> }}} |
Line 15: | Line 34: |
* Here is the link to the [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/snapshot.2012-06-27T16:00/|SVN snapshot]] of the code files just after the last exercise sheet deadline (June 27, 2012 @ 16:00). * Here is the summary of the [[EfficientRoutePlanningSS2012/Feedback|official evaluation of the course]]. * 20Aug11 11:00pm: we have corrected your exam, [[EfficientRoutePlanningSS2012/Exam|click here for further information]]. |
|
Line 20: | Line 42: |
* Lecture 1, Wednesday, April 25, 2012 (Introduction, Organizational, Road Networks, OSM Data): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-1|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-1.txt|Points scheme]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/saarland.osm.bz2|OSM data Saarland (24-Apr-2012 18:52, bz2-compresssed)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/baden-wuerttemberg.osm.bz2|OSM data Baden-Württemberg (24-Apr-2012 19:44, bz2-compresssed)]], [[EfficientRoutePlanningSS2012/RoadTypesAndSpeeds|Table road types <-> speeds]], [[EfficientRoutePlanningSS2012/ReadOsmResults|Table with your "OSM -> graph" results]]. * Lecture 2, Wednesday, May 2, 2012 (Dijkstra's algorithm, Connected components, Jenkins): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/get-video.php?file=lecture-2|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-2.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-2.pdf|Exercise Sheet 2]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-2.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/|Code skeleton for RoadNetwork and DijkstraAlgorithm class]], [[EfficientRoutePlanningSS2012/DijkstraResults|Table with your Dijkstra results]]. * Lecture 3, Wednesday, May 9, 2012 (A*, Landmarks, Set Dijkstra): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-2.pdf|Exercise Sheet 2]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/lectures/NEW|Code skeleton]], [[EfficientRoutePlanningSS2012/AstarResults|Table with your A* results]]. |
* Lecture 1, Wednesday, April 25, 2012 (Introduction, Organizational, Road Networks, OSM Data): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-1.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-1.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-1.pdf|Exercise Sheet 1]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-1.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-1/|Code design suggestions]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/saarland.osm.bz2|OSM data Saarland (24-Apr-2012 18:52, bz2-compresssed)]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/baden-wuerttemberg.osm.bz2|OSM data Baden-Württemberg (24-Apr-2012 19:44, bz2-compresssed)]], [[EfficientRoutePlanningSS2012/RoadTypesAndSpeeds|Table road types <-> speeds]], [[EfficientRoutePlanningSS2012/ReadOsmResults|Table with your "OSM -> graph" results]]. * Lecture 2, Wednesday, May 2, 2012 (Dijkstra's algorithm, Connected components, Jenkins): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-2.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-2.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-2.pdf|Exercise Sheet 2]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-2.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-2/|Code design suggestions]], [[EfficientRoutePlanningSS2012/DijkstraResults|Table with your Dijkstra results]]. * Lecture 3, Wednesday, May 9, 2012 (A*, Landmarks, Set Dijkstra): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-3.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-3.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-3.pdf|Exercise Sheet 3]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-3.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-3/|Code design suggestions]], [[EfficientRoutePlanningSS2012/AstarResults|Table with your A* results]]. * Lecture 4, Wednesday, May 16, 2012 (Arc Flags, Visualization): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-4.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-4.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-4.pdf|Exercise Sheet 4]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-4.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-4/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Table with your Arc Flags results]]. * Lecture 5, Wednesday, May 16, 2012 (Web application, Google Maps API): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-5.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-5.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-5.pdf|Exercise Sheet 5]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-5.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-5/|Code from the lecture]]. * Lecture 6, Wednesday, June 6, 2012 (Contraction Hierarchies, Part 1): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-6.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-6.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-6.pdf|Exercise Sheet 6]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-6.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-6/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ContractionResults|Table with your node contraction results]]. * Lecture 7, Wednesday, June 13, 2012 (Contraction Hierarchies, Part 2): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-7.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-7.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-7.pdf|Exercise Sheet 7]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-7.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-7/|Code design suggestions]], [[EfficientRoutePlanningSS2012/ContractionHierarchiesResults|Table with your Contraction Hierarchies results]]. * No lecture on Wednesday, June 20, 2012 (cancelled at short notice because Prof. Bast fell sick due to a vicious viral attack). Deadline for Exercise Sheet 7 was extended by one week, until June 27, 4:00pm. * Lecture 8, Wednesday, June 27, 2012 (Transit Node Routing): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-8.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-8.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-8.pdf|Exercise Sheet 8]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-8.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-8/|Code design suggestions]], [[EfficientRoutePlanningSS2012/TransitNodesResults|Table with your Transit Node Routing results]]. * Lecture 9, Wednesday, July 4, 2012 (Public Transportation Networks, GTFS): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-9.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-9.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-9.pdf|Exercise Sheet 9]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-9.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-9/|Code design suggestions]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/manhattan.gtfs.zip|GTFS data Manhattan (03-Jul-2012 21:41, zip-archive)]], [[EfficientRoutePlanningSS2012/GtfsResults|Table with your GTFS results]]. * Lecture 10, Wednesday, July 11, 2012 (Multi-criteria cost, Multi-label Dijkstra, Road vs. Transit networks): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-10.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-10.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-10.pdf|Exercise Sheet 10]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-10.txt|Points scheme]]. * Lecture 11, Wednesday, July 18, 2012 (Transfer Patterns, Official Course Evaluation): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-11.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-11.pdf|Slides]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/exercise-sheet-11.pdf|Exercise Sheet 11]], [[https://daphne.informatik.uni-freiburg.de/svn/EfficientRoutePlanningSS2012/exercises/points-scheme-11.txt|Points scheme]], [[https://daphne.informatik.uni-freiburg.de/svn-public/EfficientRoutePlanningSS2012/lectures/lecture-11/|Code design suggestions]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/hawaii.gtfs.zip|GTFS data Hawaii (17-Jul-2012 21:18, zip-archive)]], [[EfficientRoutePlanningSS2012/TransferPatterns|Table with your Transfer Patterns results]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/evaluation-form.pdf|Evaluation form, please read the instructions below!]]. * Lecture 12, Wednesday, July 25, 2012 (Course Evaluation Results, Exam, Work at our Chair): [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-12.mp4|Video recording]], [[http://ad-teaching.informatik.uni-freiburg.de/route-planning-ss2012/lecture-12.pdf|Slides]], [[EfficientRoutePlanningSS2012/Feedback|Details of course evaluation]]. ''Instructions for filling our the Evaluation Form'' 1. The evaluation form is a PDF form, please fill it out *electronically*. If possible use the full version of Adobe Acrobat for this (not just the reader). Then you can store the filled out form as a PDF again. With only the reader, saving might not possible. Then you have to print the form as PDF. Note that in that case, any text beyond the 600 letters that fit in one of the free-text boxes is lost. So please stick to that limit in that case. 2. Explicitly *logout* from Daphne, for example via [[https://daphne.informatik.uni-freiburg.de/logout|this link|target="_blank"]] (link will be opened in a new tab, afterward go back to this page, so that you can continue to read.) Like this your submission will be anonymous. Without logging out from Daphne, the following steps will not work. 3. Go the forum for the course, for example via [[https://daphne.informatik.uni-freiburg.de/forum|this link|target="_blank"]] (also opens in a new tab). The login again as user ''evaluation'' with password ''SS2012''. 4. Go to the subforum ''Efficient Route Planning, SS 2012 -> Official -> Evaluation''. Upload your filled out evaluation form there, as an attachment to a random post (which must have a minimal amount of text, consider using your credit card number for that). After the upload, neither you nor any other participant can view the uploaded evaluation form. |
Welcome to the Wiki of the course '''Efficient Route Planning''' in the summer term 2012
Here is all the information about the exam.
Here are the results for the official evaluation of this course.
The course was given by Prof. Dr. Hannah Bast and took place every Wednesday from 4:15pm until 5:45pm, in seminar room 01-009/13 in building 101. The first lecture was on Wednesday, April 25, 2012 and the last lecture was on Wednesday, July 25, 2012. There was be no lecture on Wednesday, May 30, 2012 (pentecost holidays). That was 13 lectures altogether.
The tutors for this course were Mirko Brodesser (mirko.brodesser@gmail.com) and Eugen Sawin (esawin@gmail.com). 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).
Important Links
Here is the link to Daphne, our course management system.
Here is the link to the Forum (for annoucements and questions).
Here is the link to our CodingStandards.
Here is the link to the slides, video recordings, etc. from last year. Note that the overall contents of this year's lecture will be similar, but that there will be quite a bit of variation / improvement, based on my experiences and the student feedback from last year.
Here is the link to the SVN snapshot of the code files just after the last exercise sheet deadline (June 27, 2012 @ 16:00).
Here is the summary of the official evaluation of the course.
20Aug11 11:00pm: we have corrected your exam, click here for further information.
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, Wednesday, April 25, 2012 (Introduction, Organizational, Road Networks, OSM Data): Video recording, Slides, Exercise Sheet 1, Points scheme, Code design suggestions, OSM data Saarland (24-Apr-2012 18:52, bz2-compresssed), OSM data Baden-Württemberg (24-Apr-2012 19:44, bz2-compresssed), Table road types <-> speeds, Table with your "OSM -> graph" results.
Lecture 2, Wednesday, May 2, 2012 (Dijkstra's algorithm, Connected components, Jenkins): Video recording, Slides, Exercise Sheet 2, Points scheme, Code design suggestions, Table with your Dijkstra results.
Lecture 3, Wednesday, May 9, 2012 (A*, Landmarks, Set Dijkstra): Video recording, Slides, Exercise Sheet 3, Points scheme, Code design suggestions, Table with your A* results.
Lecture 4, Wednesday, May 16, 2012 (Arc Flags, Visualization): Video recording, Slides, Exercise Sheet 4, Points scheme, Code design suggestions, Table with your Arc Flags results.
Lecture 5, Wednesday, May 16, 2012 (Web application, Google Maps API): Video recording, Slides, Exercise Sheet 5, Points scheme, Code from the lecture.
Lecture 6, Wednesday, June 6, 2012 (Contraction Hierarchies, Part 1): Video recording, Slides, Exercise Sheet 6, Points scheme, Code design suggestions, Table with your node contraction results.
Lecture 7, Wednesday, June 13, 2012 (Contraction Hierarchies, Part 2): Video recording, Slides, Exercise Sheet 7, Points scheme, Code design suggestions, Table with your Contraction Hierarchies results.
- No lecture on Wednesday, June 20, 2012 (cancelled at short notice because Prof. Bast fell sick due to a vicious viral attack). Deadline for Exercise Sheet 7 was extended by one week, until June 27, 4:00pm.
Lecture 8, Wednesday, June 27, 2012 (Transit Node Routing): Video recording, Slides, Exercise Sheet 8, Points scheme, Code design suggestions, Table with your Transit Node Routing results.
Lecture 9, Wednesday, July 4, 2012 (Public Transportation Networks, GTFS): Video recording, Slides, Exercise Sheet 9, Points scheme, Code design suggestions, GTFS data Manhattan (03-Jul-2012 21:41, zip-archive), Table with your GTFS results.
Lecture 10, Wednesday, July 11, 2012 (Multi-criteria cost, Multi-label Dijkstra, Road vs. Transit networks): Video recording, Slides, Exercise Sheet 10, Points scheme.
Lecture 11, Wednesday, July 18, 2012 (Transfer Patterns, Official Course Evaluation): Video recording, Slides, Exercise Sheet 11, Points scheme, Code design suggestions, GTFS data Hawaii (17-Jul-2012 21:18, zip-archive), Table with your Transfer Patterns results, Evaluation form, please read the instructions below!.
Lecture 12, Wednesday, July 25, 2012 (Course Evaluation Results, Exam, Work at our Chair): Video recording, Slides, Details of course evaluation.
Instructions for filling our the Evaluation Form
1. The evaluation form is a PDF form, please fill it out *electronically*. If possible use the full version of Adobe Acrobat for this (not just the reader). Then you can store the filled out form as a PDF again. With only the reader, saving might not possible. Then you have to print the form as PDF. Note that in that case, any text beyond the 600 letters that fit in one of the free-text boxes is lost. So please stick to that limit in that case.
2. Explicitly *logout* from Daphne, for example via this link (link will be opened in a new tab, afterward go back to this page, so that you can continue to read.) Like this your submission will be anonymous. Without logging out from Daphne, the following steps will not work.
3. Go the forum for the course, for example via this link (also opens in a new tab). The login again as user evaluation with password SS2012.
4. Go to the subforum Efficient Route Planning, SS 2012 -> Official -> Evaluation. Upload your filled out evaluation form there, as an attachment to a random post (which must have a minimal amount of text, consider using your credit card number for that). After the upload, neither you nor any other participant can view the uploaded evaluation form.