رسالة جامعية
Finding shortest paths in large scale networks
| العنوان: | Finding shortest paths in large scale networks |
|---|---|
| المؤلفون: | Antsfeld, Leonid |
| بيانات النشر: | UNSW, Sydney |
| سنة النشر: | 2014 |
| المجموعة: | UNSW Sydney (The University of New South Wales): UNSWorks |
| مصطلحات موضوعية: | Grid networks, Shortest paths, Public transportation networks |
| الوصف: | Finding the shortest path between two points in a network is a fundamental problem in computer science with many applications. By exploiting properties of the underlying networks we improve and extend one of the state-of-the-art algorithms for finding shortest paths in road networks, Transit Node Routing (TNR). We develop a new algorithm for finding shortest pathsin public multi-modal transport networks, where we need to deal with other requirements such as transfers, multi-objectiveness, user preferences, etc. Finally we extend our technique to the new domain of grid networks, where one of the challenges is to deal with path symmetries. |
| نوع الوثيقة: | doctoral or postdoctoral thesis |
| وصف الملف: | application/pdf |
| اللغة: | English |
| العلاقة: | http://hdl.handle.net/1959.4/53850Test; https://unsworks.unsw.edu.au/bitstreams/4e530b4b-95a6-4e3f-ab83-2975d9bdfbcd/downloadTest; https://doi.org/10.26190/unsworks/17043Test |
| DOI: | 10.26190/unsworks/17043 |
| الإتاحة: | https://doi.org/10.26190/unsworks/17043Test http://hdl.handle.net/1959.4/53850Test https://unsworks.unsw.edu.au/bitstreams/4e530b4b-95a6-4e3f-ab83-2975d9bdfbcd/downloadTest |
| حقوق: | open access ; https://purl.org/coar/access_right/c_abf2Test ; CC BY-NC-ND 3.0 ; https://creativecommons.org/licenses/by-nc-nd/3.0/auTest/ ; free_to_read |
| رقم الانضمام: | edsbas.A08FBE93 |
| قاعدة البيانات: | BASE |
| DOI: | 10.26190/unsworks/17043 |
|---|