Urban Traﬀic Analysis Using Limited Queries from a Predicting Source

Please enable javascript in your browser.

Akbari Bibihayat, Saeed | 2021

443 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 54476 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Abam, Mohammad Ali
Abstract:
In local transportation service companies, there is a need for estimation of arrival times (ETA) for customers. These companies not having the suﬀicient number of active online users, they are not able to obtain a proper estimation for ETA from that data. However, there are some overseas companies that have the established user base, and provide access to necessary data with a service fee. It is possible to solve this problem using the data which they provide.In this thesis, the problem of learning a hidden graph for the purpose of aiding local companies is explained and different aspects of it are introduced. In order to tackle this problem, first we define the idea of vertex separators, and then we propose a method based on them to estimate arrival times. We begin by simpler forms of graphs, starting with linear graphs, then trees and finally, planar graphs that have the most correspondence to our problem space
Keywords:
Routing ; Separators ; Traffic Analysis ; Urban Traffic ; Estimated Arrival Time ; Graph Algorithms ; Ride-Sharing System