skip to main content
10.1145/2068984.2068987acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Crowd-sourced carpool recommendation based on simple and efficient trajectory grouping

Published: 01 November 2011 Publication History

Abstract

We propose a novel carpool recommendation method that is based on simplifying a user's movement traces. An effective carpool recommendation system requires that users following the most similar driving routes be identified and that these routes then be consolidated into one or more 'recommended' optimal carpool driving route options that users' can choose from. Currently mobile users generate a high volume of detailed trajectory data, making it difficult to efficiently derive optimal recommendations. We devise a simple method for building a user's trajectory profile, which is then used in deriving the recommendation(s). Unlike an origin-destination based analysis, which matches up riders with drivers, our method creates feature points along a simplified path that has been derived from the mobile user's moving trace. This maintains the sequence of movements and preserves feature points, including intersections and common places. Feature points are mapped using quad-keys as part of a tile map system that enables a membership of feature points within the range of a given area. Using this membership, recommendations for optimal carpool routes are made by measuring how users share common quad-keys along their trajectories. We tested our proposed method using historical traces of two crowd-sourced projects: TrafficPulse and GeoLife. The results show the advantage of the proposed method for dealing with a high volume of detailed mobile trajectory data, both in terms of requiring reduced data storage space and requiring reduced computational cost.

References

[1]
Avego. http://www.avego.com.
[2]
Microsoft, bing maps tile system. http://msdn.microsoft.com/en-us/library/bb259689.aspx.
[3]
Microsoft research, geolife project. http://research.microsoft.com/jump/79442.
[4]
L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. String Processing and Information Retrieval, International Symposium on, 0:39, 2000.
[5]
D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer, 10(2):112--122, 1973.
[6]
E. Fredkin. Trie memory. Communications of the ACM, 3(9):490--499, 1960.
[7]
D. Lee, R. Li, and S. Liang. Trafficpulse project. http://trafficpulse.ca.
[8]
L. N. and C. G. Sharing location in online social networks. IEEE Network, 24(5):20--25, 2010.
[9]
R. F. Teal. Carpooling: Who, how and why. Transportation Research Part A: General, 21(3):203--214, May 1987.
[10]
E. Tiakas, A. N. Papadopoulos, A. Nanopoulos, Y. Manolopoulos, D. Stojanovic, and S. Djordjevic-Kajan. Searching for similar trajectories in spatial networks. J. Syst. Softw., 82:772--788, May 2009.
[11]
M. Vlachos, G. Kollios, and D. Gunopulos. Discovering similar multidimensional trajectories. In Proceedings of the 18th International Conference on Data Engineering, pages 673--684. IEEE Computer Society, 2002.
[12]
H. J. V. Zuylen and L. G. Willumsen. The most likely trip matrix estimated from traffic counts. Transportation Research Part B: Methodological, 14(3):281--293, September 1980.

Cited By

View all
  • (2023)Oblivious Statistic Collection With Local Differential Privacy in Mutual DistrustIEEE Access10.1109/ACCESS.2023.325156011(21374-21386)Online publication date: 2023
  • (2022)Decoupling Statistical Trends from Data Volume on LDP-Based Spatio-Temporal Data Collection2022 IEEE Future Networks World Forum (FNWF)10.1109/FNWF55208.2022.00053(262-269)Online publication date: Oct-2022
  • (2022)Bayesian hierarchical models for the prediction of the driver flow and passenger waiting times in a stochastic carpooling serviceJournal of Applied Statistics10.1080/02664763.2022.202689650:6(1310-1333)Online publication date: 24-Jan-2022
  • Show More Cited By

Index Terms

  1. Crowd-sourced carpool recommendation based on simple and efficient trajectory grouping

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CTS '11: Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
    November 2011
    61 pages
    ISBN:9781450310345
    DOI:10.1145/2068984
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 November 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article

    Conference

    GIS '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 42 of 57 submissions, 74%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Oblivious Statistic Collection With Local Differential Privacy in Mutual DistrustIEEE Access10.1109/ACCESS.2023.325156011(21374-21386)Online publication date: 2023
    • (2022)Decoupling Statistical Trends from Data Volume on LDP-Based Spatio-Temporal Data Collection2022 IEEE Future Networks World Forum (FNWF)10.1109/FNWF55208.2022.00053(262-269)Online publication date: Oct-2022
    • (2022)Bayesian hierarchical models for the prediction of the driver flow and passenger waiting times in a stochastic carpooling serviceJournal of Applied Statistics10.1080/02664763.2022.202689650:6(1310-1333)Online publication date: 24-Jan-2022
    • (2020)Secure and Efficient Trajectory-Based Contact Tracing using Trusted Hardware2020 IEEE International Conference on Big Data (Big Data)10.1109/BigData50022.2020.9378187(4016-4025)Online publication date: 10-Dec-2020
    • (2019)Ad Hoc Carpooling Prediction Based on Improved kNN2019 12th International Symposium on Computational Intelligence and Design (ISCID)10.1109/ISCID.2019.10120(162-167)Online publication date: Dec-2019
    • (2019)Toward using social media to support ridesharing services: challenges and opportunitiesTransportation Planning and Technology10.1080/03081060.2019.160024242:4(355-379)Online publication date: 5-Apr-2019
    • (2017)If It’s ConvenientProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/31309131:3(1-28)Online publication date: 11-Sep-2017
    • (2017)Never drive aloneInformation Systems10.1016/j.is.2016.03.00664:C(237-257)Online publication date: 1-Mar-2017
    • (2015)Social or Green? A Data-Driven Approach for More Enjoyable CarpoolingProceedings of the 2015 IEEE 18th International Conference on Intelligent Transportation Systems10.1109/ITSC.2015.142(842-847)Online publication date: 15-Sep-2015
    • (2012)TrafficPulseProceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems10.1145/2442810.2442813(9-16)Online publication date: 6-Nov-2012

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media