Identification of Common Paths for Rideshare Routing by Mining Vehicle Trajectories

被引:0
|
作者
Sun, Danyang [1 ]
Leurent, Fabien [2 ]
机构
[1] Ecole Ponts ParisTech, Lab Ville Mobil Transport, Champ Sur Marne, France
[2] Ecole Ponts ParisTech, Ctr Int Rech Environm & Dev, Nogent Sur Marne, France
关键词
data and data science; artificial intelligence; pattern recognition; unsupervised learning; big data; probe vehicle data; spatial data;
D O I
10.1177/03611981231184173
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Trajectory data generated from various location sensors are increasingly available nowadays, providing comprehensive information on detailed itineraries that can be used in traffic and mobility analyses. This paper presents a study on the identification of underlying traffic stream clusters by exploring vehicle trajectory data. It aims to break down the spatial distribution of mobility flows and recognize the common paths according to which tentative rideshare routes could be set up. A step-by-step methodological framework, which includes map matching, measuring path similarity at the geometry level, trajectory clustering according to overlapping segments, locating trunk routes on the network, and classifying new trajectories on the identified routes, is proposed. An experiment has been conducted using trajectories collected in the real world. The results showed that different traffic streams with regard to direction and travel distance can be identified clearly. Overall, this study offers a comprehensive means of leveraging trajectory data to analyze itinerary patterns and make comparisons between trajectories. Compared with previous efforts, the proposed method is effective in distinguishing between traffic streams even with regard to bidirectional flows along the same route. In addition, it has the capacity to identify the common routes of underlying traffic streams instead of simply picking out single hot links or origin-destination pairs. This study is an example of data-driven research that uses digital trajectories to detect common path issues and offers detailed guidance on its application in this respect.
引用
收藏
页码:217 / 227
页数:11
相关论文
共 50 条
  • [21] A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
    Hadjiconstantinou, E
    Christofides, N
    Mingozzi, A
    ANNALS OF OPERATIONS RESEARCH, 1995, 61 : 21 - 43
  • [22] On the intermittence of routing paths in vehicle-formed mobile ad hoc networks on highways
    Wang, SY
    ITSC 2004: 7TH INTERNATIONAL IEEE CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, PROCEEDINGS, 2004, : 803 - 809
  • [23] Discovery of Critical Nodes in Road Networks Through Mining From Vehicle Trajectories
    Xu, Ming
    Wu, Jianping
    Liu, Mengqi
    Xiao, Yunpeng
    Wang, Haohan
    Hu, Dongmei
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (02) : 583 - 593
  • [24] An evaluation of common modeling choices for the vehicle routing problem with stochastic demands
    Hoogendoorn, Y. N.
    Spliet, R.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 321 (01) : 107 - 122
  • [25] A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
    Bolduc, M-C
    Renaud, J.
    Boctor, F.
    Laporte, G.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (06) : 776 - 787
  • [26] A Modified On-Demand Vector Distance Routing Protocol Incorporating Alternate Vehicle-RSU-Vehicle and Vehicle-RSU- RSU Paths
    Al-Kasasbeh, Basil
    INFORMATICA-AN INTERNATIONAL JOURNAL OF COMPUTING AND INFORMATICS, 2022, 46 (06): : 45 - 51
  • [27] Automatic intersection and traffic rule detection by mining motor-vehicle GPS trajectories
    Wang, Jing
    Wang, Chaoliang
    Song, Xianfeng
    Raghavan, Venkatesh
    COMPUTERS ENVIRONMENT AND URBAN SYSTEMS, 2017, 64 : 19 - 29
  • [28] A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem
    Zoltán Blázsik
    Zoltán Imre Fajfrik
    Central European Journal of Operations Research, 2017, 25 : 55 - 70
  • [29] A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
    Cote, Jean-Francois
    Potvin, Jean-Yves
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (02) : 464 - 469
  • [30] A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem
    Blazsik, Zoltan
    Fajfrik, Zoltan Imre
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2017, 25 (01) : 55 - 70