Applying Path Planning Algorithms to Train Schedules
dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Oostrom, V. van | |
dc.contributor.author | Soethout, T.M. | |
dc.date.accessioned | 2012-04-12T17:00:47Z | |
dc.date.available | 2012-04-12 | |
dc.date.available | 2012-04-12T17:00:47Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/10293 | |
dc.description.sponsorship | Utrecht University | |
dc.format.extent | 676065 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | Applying Path Planning Algorithms to Train Schedules | |
dc.type.content | Bachelor Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | Graph, Route planning, Train, Eppstein, Shortest path, Dijkstra, k shortest paths, Programming, | |
dc.subject.courseuu | Kunstmatige Intelligentie |