Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/590289
Title: | Scalable opportunistic shortest path problems on road networks |
Researcher: | Ghosh, Debajyoti |
Guide(s): | Khatter, Kiran |
Keywords: | Computer Science Computer Science Software Engineering Engineering and Technology |
University: | BML Munjal University, Gurugram |
Completed Date: | 2023 |
Abstract: | Spatial information has now become a crucial tool for decision-making and daily needs for millions of people worldwide. Route planning apps are used by millions of users to find the shortest paths when traveling on the road network. This dissertation deals with opportunistic problems along the shortest paths involving a small but bounded detour in order to achieve common tasks such as picking up and delivering a package on the way, or stopping at a POI on the way from the source to the destination. newlineThe problems studied here are from the perspective of a spatial platform provider that wants to offer opportunistic services to its millions of users. Hence, the key dimensions of interest are the scalability of the platform in terms of latency to serve a user quickly and a large throughput to cater to billions of users. The strategy the dissertation advocates is precomputation, which provides the necessary scalability to serve billions of users and spatial objects of interest (e.g., packages, POIs, etc.). newlineDuring the literature review, it was observed that existing research predominantly focuses on single-package deliveries, especially those picked up by drivers along their existing routes. In our proposed study, we tackled the same challenge of delivering a package directly to a designated driver while adhering to a pre-specified detour limit. Our objective was to identify which available packages could be efficiently integrated into a driver s route with minimal detours. This allowed users to gradually deliver packages with increasing detours as they traveled. newlineTo address this challenge, we introduced a spatial platform known as Package Delivery as a Service (PDaaS), tailored for expansive road networks. PDaaS offers users optimal route suggestions to enhance the efficiency of package deliveries during their journeys. We demonstrated that the proposed algorithm s performance scales effectively with the increasing number of packages. newline |
Pagination: | xvi, 121 |
URI: | http://hdl.handle.net/10603/590289 |
Appears in Departments: | School of Engineering and Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 21.67 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 3.12 MB | Adobe PDF | View/Open | |
03_content.pdf | 400.75 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 270.17 kB | Adobe PDF | View/Open | |
05_chapter 1.pdf | 2.33 MB | Adobe PDF | View/Open | |
06_chapter 2.pdf | 1.68 MB | Adobe PDF | View/Open | |
07_chapter 3.pdf | 9.33 MB | Adobe PDF | View/Open | |
08_chapter 4.pdf | 4.32 MB | Adobe PDF | View/Open | |
09_chapter 5.pdf | 779.62 kB | Adobe PDF | View/Open | |
10_annexures.pdf | 2.7 MB | Adobe PDF | View/Open | |
80_recommendation.pdf | 779.62 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: