SHAREK: A Scalable Dynamic Ride Sharing System

Bin Cao, Louai Alarabi, Mohamed Mokbel, Anas Basalamah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)

Abstract

Due to its significant economic and environmental impact, sharing the ride among a number of drivers (i.e., Car pooling) has recently gained significant interest from industry and academia. Hence, a number of ride sharing services have appeared along with various algorithms on how to match a rider request to a driver who can provide the ride sharing service. However, existing techniques have several limitations that affect the quality of the ride sharing service, and hence hinder its wide applicability. This paper proposes SHAREK, a scalable and efficient ride sharing service that overcomes the limitations of existing approaches. SHAREK allows riders requesting the ride sharing service to indicate the maximum price they are willing to pay for the service and the maximum waiting time before being picked up. In the mean time, SHAREK computes the price of the service based on the distance of the rider trip and the detour that the driver will make to offer the service. Then, SHAREK returns a set of drivers that can make it to the rider within its price and temporal constraints. Since there could be many of such drivers, SHAREK internally prunes those drivers that are dominated by others, i.e., They provide higher price and higher waiting time than other drivers. To realize its efficiency and scalability, SHAREK employs a set of early pruning techniques that minimize the need for any actual shortest path computations.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4-13
Number of pages10
Volume1
ISBN (Electronic)9781479999729
DOIs
Publication statusPublished - 11 Sep 2015
Externally publishedYes
Event16th IEEE International Conference on Mobile Data Management, MDM 2015 - Pittsburgh, United States
Duration: 15 Jun 201518 Jun 2015

Other

Other16th IEEE International Conference on Mobile Data Management, MDM 2015
CountryUnited States
CityPittsburgh
Period15/6/1518/6/15

Fingerprint

Environmental impact
Scalability
Railroad cars
Economics
Industry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cao, B., Alarabi, L., Mokbel, M., & Basalamah, A. (2015). SHAREK: A Scalable Dynamic Ride Sharing System. In Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015 (Vol. 1, pp. 4-13). [7264299] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MDM.2015.12

SHAREK : A Scalable Dynamic Ride Sharing System. / Cao, Bin; Alarabi, Louai; Mokbel, Mohamed; Basalamah, Anas.

Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015. Vol. 1 Institute of Electrical and Electronics Engineers Inc., 2015. p. 4-13 7264299.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cao, B, Alarabi, L, Mokbel, M & Basalamah, A 2015, SHAREK: A Scalable Dynamic Ride Sharing System. in Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015. vol. 1, 7264299, Institute of Electrical and Electronics Engineers Inc., pp. 4-13, 16th IEEE International Conference on Mobile Data Management, MDM 2015, Pittsburgh, United States, 15/6/15. https://doi.org/10.1109/MDM.2015.12
Cao B, Alarabi L, Mokbel M, Basalamah A. SHAREK: A Scalable Dynamic Ride Sharing System. In Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015. Vol. 1. Institute of Electrical and Electronics Engineers Inc. 2015. p. 4-13. 7264299 https://doi.org/10.1109/MDM.2015.12
Cao, Bin ; Alarabi, Louai ; Mokbel, Mohamed ; Basalamah, Anas. / SHAREK : A Scalable Dynamic Ride Sharing System. Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015. Vol. 1 Institute of Electrical and Electronics Engineers Inc., 2015. pp. 4-13
@inproceedings{a612a016307d41aba164aa052515f49b,
title = "SHAREK: A Scalable Dynamic Ride Sharing System",
abstract = "Due to its significant economic and environmental impact, sharing the ride among a number of drivers (i.e., Car pooling) has recently gained significant interest from industry and academia. Hence, a number of ride sharing services have appeared along with various algorithms on how to match a rider request to a driver who can provide the ride sharing service. However, existing techniques have several limitations that affect the quality of the ride sharing service, and hence hinder its wide applicability. This paper proposes SHAREK, a scalable and efficient ride sharing service that overcomes the limitations of existing approaches. SHAREK allows riders requesting the ride sharing service to indicate the maximum price they are willing to pay for the service and the maximum waiting time before being picked up. In the mean time, SHAREK computes the price of the service based on the distance of the rider trip and the detour that the driver will make to offer the service. Then, SHAREK returns a set of drivers that can make it to the rider within its price and temporal constraints. Since there could be many of such drivers, SHAREK internally prunes those drivers that are dominated by others, i.e., They provide higher price and higher waiting time than other drivers. To realize its efficiency and scalability, SHAREK employs a set of early pruning techniques that minimize the need for any actual shortest path computations.",
author = "Bin Cao and Louai Alarabi and Mohamed Mokbel and Anas Basalamah",
year = "2015",
month = "9",
day = "11",
doi = "10.1109/MDM.2015.12",
language = "English",
volume = "1",
pages = "4--13",
booktitle = "Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - SHAREK

T2 - A Scalable Dynamic Ride Sharing System

AU - Cao, Bin

AU - Alarabi, Louai

AU - Mokbel, Mohamed

AU - Basalamah, Anas

PY - 2015/9/11

Y1 - 2015/9/11

N2 - Due to its significant economic and environmental impact, sharing the ride among a number of drivers (i.e., Car pooling) has recently gained significant interest from industry and academia. Hence, a number of ride sharing services have appeared along with various algorithms on how to match a rider request to a driver who can provide the ride sharing service. However, existing techniques have several limitations that affect the quality of the ride sharing service, and hence hinder its wide applicability. This paper proposes SHAREK, a scalable and efficient ride sharing service that overcomes the limitations of existing approaches. SHAREK allows riders requesting the ride sharing service to indicate the maximum price they are willing to pay for the service and the maximum waiting time before being picked up. In the mean time, SHAREK computes the price of the service based on the distance of the rider trip and the detour that the driver will make to offer the service. Then, SHAREK returns a set of drivers that can make it to the rider within its price and temporal constraints. Since there could be many of such drivers, SHAREK internally prunes those drivers that are dominated by others, i.e., They provide higher price and higher waiting time than other drivers. To realize its efficiency and scalability, SHAREK employs a set of early pruning techniques that minimize the need for any actual shortest path computations.

AB - Due to its significant economic and environmental impact, sharing the ride among a number of drivers (i.e., Car pooling) has recently gained significant interest from industry and academia. Hence, a number of ride sharing services have appeared along with various algorithms on how to match a rider request to a driver who can provide the ride sharing service. However, existing techniques have several limitations that affect the quality of the ride sharing service, and hence hinder its wide applicability. This paper proposes SHAREK, a scalable and efficient ride sharing service that overcomes the limitations of existing approaches. SHAREK allows riders requesting the ride sharing service to indicate the maximum price they are willing to pay for the service and the maximum waiting time before being picked up. In the mean time, SHAREK computes the price of the service based on the distance of the rider trip and the detour that the driver will make to offer the service. Then, SHAREK returns a set of drivers that can make it to the rider within its price and temporal constraints. Since there could be many of such drivers, SHAREK internally prunes those drivers that are dominated by others, i.e., They provide higher price and higher waiting time than other drivers. To realize its efficiency and scalability, SHAREK employs a set of early pruning techniques that minimize the need for any actual shortest path computations.

UR - http://www.scopus.com/inward/record.url?scp=84958171774&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958171774&partnerID=8YFLogxK

U2 - 10.1109/MDM.2015.12

DO - 10.1109/MDM.2015.12

M3 - Conference contribution

AN - SCOPUS:84958171774

VL - 1

SP - 4

EP - 13

BT - Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -