Kerwin D. Go’s research while affiliated with De La Salle University and other places

With the proliferation of vehicular mobility traces because of inexpensive on-board sensors and smartphones, utilizing them to further understand road movements have become easily accessible. These huge numbers of vehicular traces can be utilized to determine where to enhance road infrastructures such as the deployment of electric vehicle (EV) charging stations. As more EVs are plying today’s roads, the driving anxiety is minimized with the presence of sufficient charging stations. By correctly extracting the various transportation parameters from a given dataset, one can design an adequate and adaptive EV charging network that can provide comfort and convenience for the movement of people and goods from one point to another. In this study, we determined the possible EV charging station locations based on an urban city’s vehicular capacity distribution obtained from taxi and ride-hailing mobility GPS traces. To achieve this, we first transformed the dynamic vehicular environment based on vehicular capacity into its equivalent urban single snapshot. We then obtained the various traffic zone distributions by initially utilizing k-means clustering to allow flexibility in the total number of wanted traffic zones in each dataset. In each traffic zone, iterative clustering techniques employing Density-based Spatial Clustering of Applications with Noise (DBSCAN) or clustering by fast search and find of density peaks (CFS) revealed various area separation where EV chargers were needed. Finally, to find the exact location of the EV charging station, we last ran k-means to locate centroids, depending on the constraint on how many EV chargers were needed. Extensive simulations revealed the strengths and weaknesses of the clustering methods when applied to our datasets. We utilized the silhouette and Calinski–Harabasz indices to measure the validity of cluster formations. We also measured the inter-station distances to understand the closeness of the locations of EV chargers. Our study shows how CFS + k-means clustering techniques are able to pinpoint EV charger locations. However, when utilizing DBSCAN initially, the results did not present any notable outcome.

In this work, we propose a Game Theory-based pricing solution to the ridesharing problem of taxi commuters that addresses the optimal selection of their travel companionship and effectively minimizes their cost. Two stable matching techniques are proposed in this study, namely: First-Come, First-Served (FCFS) and Best Time Sharing (BT). FCFS discovers pairs based on earliest time of pair occurrences, while BT prioritizes selecting pairs with high proportion of shared distance between passengers to the overall distance of their trips. We evaluate our methods through extensive simulations from empirical taxi trajectories from Jakarta, Singapore, and New York. Results in terms of post-stable matching, cost savings, successful matches, and total number of trips have been evaluated to gauge the performance with respect to the no ridesharing condition. BT outperformed FCFS in terms of generating more pairs with compatible routes. Additionally, in the New York dataset with high amount of trip density, BT has efficiently reduced the number of trips present at a given time. On the other hand, FCFS has been more effective in pairing trips for the Jakarta and Singapore datasets because of lower density due to limited number of trajectories. The Game Theory (GT) pricing model proved to generally be the most beneficial to the ride share’s cost savings, specifically leaning toward the passenger benefits. Analysis has shown that the stable matching algorithm reduced the overall number of trips while still adhering to the temporal frequency of trips within the dataset. Moreover, our developed Best Time Pairing and Game Theory Pricing methods served the most efficient based on passenger cost savings. Applying these stable matching algorithms will benefit more users and will encourage more ridesharing instances.