An Ef?cient Ride-Sharing Framework for Maximizing Shared Route

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.
Technologies
  • Android
  • .netMVC
  • PHP
  • Python
  • Java
  • Django

Abstract—Ride-sharing (RS) has great values in saving energy and alleviating traf?c pressure. Existing studies can be improved for better ef?ciency. Therefore, we propose a new ride-sharing model, where each driver has a requirement that if the driver shares a ride with a rider, the shared route percentage (i.e., the ratio of the shared route’s distance to the driver’s total travel distance) exceeds an expectation rate of the driver, e.g., 0.8. We consider two variants of this problem. The ?rst considers multiple drivers and multiple riders and aims to compute driver-rider pairs to maximize the overall shared route percentage (SRP). We model this problem as the maximum weighted bigraph matching problem, where the vertices are drivers and riders, edges are driver-rider pairs, and edge weights are driver-rider’s SRP. However, it is rather expensive to compute the SRP values for large numbers of driver-rider pairs on road networks. To address this problem, we propose an ef?cient method to prune many unnecessary driver-rider pairs and avoid computing the SRP values for every pair. To improve the ef?ciency, we propose an approximate method with error bound guarantee. The basic idea is that we compute an upper bound and a lower bound for each driver-rider pair in constant time. Then, we estimate an upper bound and a lower bound of the graph matching. Next, we select some driver-rider pairs, compute their real shortest-route distance, and update the lower and upper bounds of the maximum graph matching. We repeat above steps until the ratio of the upper bound to the lower bound is not larger than a given approximate rate. The second considers multiple drivers and a single rider and aims to ?nd the top-k drivers for the rider with the largest SRP. We ?rst prune a large number of drivers that cannot meet the SRP requirements. Then, we propose a best-?rst algorithm that progressively selects the drivers with high probability to be in the top-k results and prunes the drivers that cannot be in the top-k results. Extensive experiments on real-world datasets demonstrate the superiority of our method.

3 years ago


DOWNLOAD


Related Topics

Leukemia Detection using Digital Image Processing Techniques

ABSTRACT :This paper discusses about methods for detection of leukemia. Various image processing techniques are used for identification of red blood cell and immature white cells. Different disease like anemia, leukemia, malaria, deficiency of vitamin B12, etc. can be diagnosed accordingly. Objec...

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.


Technologies
  • PHP
  • Python
  • Java
  • Django
Point-of-interest Recommendation for Location Promotion in Location-based Social Networks

Abstract—With the wide application of location-based socialnetworks (LBSNs), point-of-interest (POI)recommendation has become one of the major services in LBSNs. The behaviors of users in LBSNs are mainly checking in POIs, and these checking-in behaviors are influenced by user’s behavior habits a...

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.


Technologies
  • PHP
  • Python
  • Java
  • Django
  • Android
Image Mining using SIFT Based Object Identification and Tagging

Abstract - Voluminous image data that are accumulated in the organizations due to frequent occurrence of various events poses tremendous challenge in terms of storage and access. This image data could be transformed into useful information, if it is analyzed. Image mining deals with extracting em...

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.


Technologies
  • PHP
  • Python
  • Java
  • Django
  • Android
  • Angular
  • .netMVC
A Novel Data Mining Approach for Brain Tumour Detection

Data mining techniques are used for mining useful trends or patterns from textual and image data sets. Medical data mining is very important field as it has significant utility in healthcare domain in the real world. The mining techniques can help the healthcare industry to improve quality of ser...

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.


Technologies
  • PHP
  • Python
  • Java
  • Django
  • Android
  • Angular
  • .netMVC
Non-overlapping Subsequence Matching of Stream Synopses

Abstract—In this paper, we propose SUbsequence Matching framework with cell MERgence (SUMMER) for online subsequence matching between histogram-based stream synopsis structures under the dynamic time warping distance. Given a query synopsis pattern, SUMMER continuously identi?es all the matching ...

  • Diploma
  • BCA
  • B.Sc
  • B.Tech/B.E.
  • M.Sc
  • MCA
  • M.Tech/M.E.


Technologies
  • PHP
  • Python
  • Java
  • Django
  • Android
  • Angular
  • .netMVC