A clustering algorithm for urban taxi carpooling based on data field energy and point spacing is proposed to solve the clustering problem of taxi carpooling on urban roads. The data field energy function is used to calculate the field energy of each data point in the passenger taxi offpoint dataset. To realize the clustering of taxis, the central point, outlier, and data points of each cluster subset are discriminated according to the threshold value determined by the product of each data point field values and point spacing. The classical algorithm and proposed algorithm are compared and analyzed by using the compactness, separation, and Dunn validity index. The clustering results of the proposed algorithm are better than those of the classical clustering algorithm. In the case of cluster numbers 25, 249, 409, and 599, the algorithm has good clustering results for the taxi trajectory dataset with certain regularity in space distribution and irregular distribution in time distribution. This algorithm is suitable for the clustering of vehicles in urban traffic roads, which can provide new ideas and methods for the cluster study of urban traffic vehicles.


    Access

    Download


    Export, share and cite



    Title :

    Clustering Algorithm for Urban Taxi Carpooling Vehicle Based on Data Field Energy


    Contributors:


    Publication date :

    2018




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    The analysis of urban taxi carpooling impact from taxi GPS data

    Qiang Xiao / Ruichun He / Changxi Ma | DOAJ | 2018

    Free access


    Optimization Based on Taxi Carpooling Preferences and Pricing

    Li, Jing / Huang, Tianming / Chen, Shangyun et al. | IEEE | 2018


    Research on Taxi Driver Strategy Game Evolution with Carpooling Detour

    Wei Zhang / Ruichun He / Changxi Ma et al. | DOAJ | 2018

    Free access

    Research on Taxi Pricing Model and Optimization for Carpooling Detour Problem

    Wei Zhang / Ruichun He / Yong Chen et al. | DOAJ | 2019

    Free access