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

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.

[1]  Shih-Chia Huang,et al.  Services-Oriented Computing Using the Compact Genetic Algorithm for Solving the Carpool Services Problem , 2015, IEEE Transactions on Intelligent Transportation Systems.

[2]  Kai Hwang,et al.  Intelligent Carpool Routing for Urban Ridesharing by Mining GPS Trajectories , 2014, IEEE Transactions on Intelligent Transportation Systems.

[3]  Song Chao-chao,et al.  Heuristic Optimization Algorithms of Multi-Carpooling Problem Based on Two-Stage Clustering , 2013 .

[4]  Yu Xiao,et al.  Approximation Sets of Rough Sets: Approximation Sets of Rough Sets , 2012 .

[5]  Yu Zheng,et al.  T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[6]  Amedeo R. Odoni,et al.  Inferring Unmet Demand from Taxi Probe Data , 2015, 2015 IEEE 18th International Conference on Intelligent Transportation Systems.

[7]  Shih-Chia Huang,et al.  An Ant Path-Oriented Carpooling Allocation Approach to Optimize the Carpool Service Problem With Time Windows , 2019, IEEE Systems Journal.

[8]  Zhang Zipeng Research on service requirement distribution algorithms in carpooling problems , 2013 .

[9]  Rongfang Bie,et al.  Clustering by fast search and find of density peaks via heat diffusion , 2016, Neurocomputing.

[10]  BieRongfang,et al.  Clustering by fast search and find of density peaks via heat diffusion , 2016 .

[11]  Cheng Jie Research on Dynamic Taxipooling Model Based on Genetic Algorithm , 2013 .

[12]  Desheng Zhang,et al.  A Carpooling Recommendation System for Taxicab Services , 2014, IEEE Transactions on Emerging Topics in Computing.

[13]  Gan Wen-yan An Hierarchical Clustering Method Based on Data Fields , 2006 .

[14]  Shih-Chia Huang,et al.  Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service Problem , 2016, IEEE Transactions on Cybernetics.

[15]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[16]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[17]  Shuliang Wang,et al.  Clustering by Fast Search and Find of Density Peaks with Data Field , 2016 .

[18]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[19]  Shih-Chia Huang,et al.  A Genetic-Algorithm-Based Approach to Solve Carpool Service Problems in Cloud Computing , 2015, IEEE Transactions on Intelligent Transportation Systems.

[20]  Shih-Chia Huang,et al.  Optimization of the Carpool Service Problem via a Fuzzy-Controlled Genetic Algorithm , 2015, IEEE Transactions on Fuzzy Systems.

[21]  Michael Lees,et al.  A Partition-Based Match Making Algorithm for Dynamic Ridesharing , 2015, IEEE Transactions on Intelligent Transportation Systems.

[22]  Wang Yang,et al.  Two-stage Estimation of Distribution Algorithm to Solve Multi-vehicle Carpooling Problem , 2016 .

[23]  Riccardo Manzini,et al.  A Decision-Support System for the Car Pooling Problem , 2012 .

[24]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[25]  Lauri Häme,et al.  An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows , 2011, Eur. J. Oper. Res..

[26]  Giuseppe Musolino,et al.  Freight vehicle routing with reliable link travel times: a method based on network fundamental diagram , 2018 .

[27]  Yu Zheng,et al.  Real-Time City-Scale Taxi Ridesharing , 2015, IEEE Transactions on Knowledge and Data Engineering.