IIIT-Delhi Institutional Repository

Finding optimal locations for taxi stands on city map

Show simple item record

dc.contributor.author Mittal, Yesha
dc.contributor.author Naik, Vinayak (Advisor)
dc.contributor.author Gunturi, Venkata M. Viswanath (Advisor)
dc.date.accessioned 2016-09-13T11:54:14Z
dc.date.available 2016-09-13T11:54:14Z
dc.date.issued 2016-09-13T11:54:14Z
dc.identifier.uri https://repository.iiitd.edu.in/jspui/handle/123456789/425
dc.description.abstract We present an algorithm which suggests suitable locations for taxi stands on a city map. This is done using pickup locations information gathered from GPS devices installed on taxis. We aim at finding locations where taxi drivers are more likely to get a passenger or locations from where passengers can be reached by travelling minimum possible distance. To do the above mentioned tasks, we have modified CLARANS algorithm. The two major changes suggested by us include 1) Selecting initial seeds by dividing space using Quadtree approach 2) Swapping medoids with non-medoids in 'nearby' areas. We have tested our method using trajectory data generated over 90 days in Singapore and have compared our solution with the optimal solution obtained using PAM algorithm. We also show that not much variation occurs in clusters' quality if we increase the size of 'nearby' areas but running time increases to almost double the value. en_US
dc.language.iso en_US en_US
dc.subject Traffic en_US
dc.subject Taxi en_US
dc.subject Clustering en_US
dc.subject K-medoid en_US
dc.subject Dijkstra en_US
dc.subject CLARANS en_US
dc.subject Quadtree en_US
dc.title Finding optimal locations for taxi stands on city map en_US
dc.type Thesis en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository

Advanced Search


My Account