With the advent of GPS tracking technology, how to make use of taxi trajectories to efficiently and effectively reduce taxis cruising distance is an active and challenging research topic. In this paper, we propose a profitable taxi route recommendation method called adaptive shortest expected cruising route (ASER). In ASER, a probabilistic network model is developed to predict pick-up probability and capacity of each location by using Kalman filtering method. To recommend profitable driving routes to taxi drivers, ASER takes the load balance between passengers and taxis into consideration and the shortest expected cruising distance is introduced to formulate potential cruising distance of taxis. Moreover, MapReduce and a novel data structure kdS-tree are applied to improve recommendation efficiency. ASER is evaluated on two real trajectory datasets from San Francisco, CA, USA, and Wuhan, China. The experimental results validate that ASER significantly outperforms the existing methods by reducing the taxi cruising distance 11% and 39%.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Profitable Taxi Travel Route Recommendation Based on Big Taxi Trajectory Data


    Contributors:
    Qu, Boting (author) / Yang, Wenxin (author) / Cui, Ge (author) / Wang, Xin (author)


    Publication date :

    2020-02-01


    Size :

    3681477 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Taxi-RS: Taxi-Hunting Recommendation System Based on Taxi GPS Data

    Xu, Xiujuan / Zhou, Jian Yu / Liu, Yu et al. | IEEE | 2015



    Recommend a profitable cruising route for taxi drivers

    Dong, Hao / Zhang, Xuedan / Dong, Yuhan et al. | IEEE | 2014


    TAXI ROUTE GENERATOR

    MILLER JASON A / THAULOW KRISTIAN I / CROYDON MATTHEW G et al. | European Patent Office | 2022

    Free access

    TAXI ROUTE GENERATOR

    MILLER JASON S / THAULOW KRISTIAN I / CROYDON MATTHEW G et al. | European Patent Office | 2022

    Free access