Book ChapterDOI
Optimal Placement of Taxis in a City Using Dominating Set Problem
Saurabh Mishra,Sonia Khetarpaul +1 more
- pp 111-124
TLDR
In this article, the authors proposed a dominating set problem based solution to find a local hotspot to cover the whole city area, which can help the drivers looking for near-by next customer in the region wherever they drop their last customer.Abstract:
Mobile application based ride-hailing systems, eg, DiDi, Uber have become part of day to day life and natural choices of transport for urban commuters However, the pick-up demand in any area is not always matching with the supply or drop-off request in the same area Urban planners and researchers are working hard to balance this demand and supply situation for taxi requests The existing approaches have mainly focused on clustering of the spatial regions to identify hotspots, which refer to the locations with a high demand for pick-up requests In our study, we determined that if the hotspots focus on the clustering of high demand for pick-up requests, most of the hotspots pivot near the city center or two-three spatial regions, ignoring the other parts of the city In this work, we proposed a method, which can help in finding a local hotspot to cover the whole city area We proposed a dominating set problem based solution, which covers every part of the city This will help the drivers looking for near-by next customer in the region wherever they drop their last customer It will also reduce the waiting time for customers as well as for a driver looking for next pick-up request This would maximize their profit as well as help in improving their servicesread more
Citations
More filters
References
More filters
Triple Connected Domination Number of a Graph
TL;DR: In this paper, the authors introduced a new domination parameter, called Smarandachely triple connected domination number of a graph, which is defined as the minimum cardinality taken over all dominating sets.
Journal ArticleDOI
Efficient method for maximizing bichromatic reverse nearest neighbor
TL;DR: This paper studies a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs and comes up with an efficient algorithm called MaxOverlap, which is many times faster than the best-known technique.
Proceedings Article
On computing top- t most influential spatial sites
TL;DR: An algorithm called TopInfluential-Sites is proposed, which finds the top-t most influential sites by browsing both trees once systematically, based on a new metric called minExistDNN.
Book ChapterDOI
Reverse nearest neighbor aggregates over data streams
TL;DR: This paper presents efficient algorithms to approximately answer these RNNA queries over data streams with error guarantees, and provides analytical proofs of constant factor approximations for manyRNNA queries, and complement the analyses with experimental evidence of the accuracy of the techniques.
Journal ArticleDOI
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
TL;DR: This paper presents a framework for continuous reverse k nearest neighbor (RkNN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions, which significantly improves the computation cost.