The simpler the better: An indexing approach for shared-route planning queries

Y Zeng, Y Tong, Y Song, L Chen - Proceedings of the VLDB Endowment, 2020 - dl.acm.org
Ridesharing services have gained global popularity as a convenient, economic, and
sustainable transportation mode in recent years. One fundamental challenge in these …

Evaluating the travel impacts of a shared mobility system for remote workers

NS Caros, J Zhao - Transportation Research Part D: Transport and …, 2023 - Elsevier
Given the rapid rise of remote work, there is an opportunity for new shared mobility services
designed to meet the needs of passengers with multiple possible work locations. This paper …

High-capacity ride-sharing via shortest path clustering on large road networks

H Zuo, B Cao, Y Zhao, B Shen, W Zheng… - The Journal of …, 2021 - Springer
Ride-sharing has been widely studied in academia and applied in mobility-on-demand
systems as a means of reducing the number of cars, congestion, and pollution by sharing …

Opportunistic package delivery as a service on road networks

D Ghosh, J Sankaranarayanan, K Khatter, H Samet - Geoinformatica, 2024 - Springer
In the new “gig” economy, a user plays the role of a consumer as well as a service provider.
As a service provider, drivers travelling from a source to a destination may opportunistically …

Efficient algorithms for community aware ridesharing

S Nabila, T Hashem, S Anwar, ABMAA Islam - GeoInformatica, 2024 - Springer
Ridesharing services have been becoming a prominent solution to reduce road traffic
congestion and environmental pollution in urban areas. Existing ridesharing services fall …

In-Path Oracles for Road Networks

D Ghosh, J Sankaranarayanan, K Khatter… - … International Journal of …, 2023 - mdpi.com
Many spatial applications benefit from the fast answering to a seemingly simple spatial
query:“Is a point of interest (POI)'in-path'to the shortest path between a source and a …

Group Trip Planning Query Problem with Multimodal Journey

D Ali, S Banerjee, Y Prasad - arXiv preprint arXiv:2502.03144, 2025 - arxiv.org
In Group Trip Planning (GTP) Query Problem, we are given a city road network where a
number of Points of Interest (PoI) have been marked with their respective categories (eg …

[PDF][PDF] Fairness Driven Efficient Algorithms for Sequenced Group Trip Planning Query Problem

N Solanki, S Jain, S Banerjee… - Proceedings of the 2023 …, 2023 - researchgate.net
Fairness Driven Efficient Algorithms for Sequenced Group Trip Planning Query Problem
Page 1 Fairness Driven Efficient Algorithms for Sequenced Group Trip Planning Query …

Who Will Travel With Me? Personalized Ranking Using Attributed Network Embedding for Pooling

L Tang, Z Liu, R Zhang, Z Duan… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In ride matching, the search results can be personalized for a particular driver. Given a query
with trip plans, it is advantageous to rank potential riders in terms of who are most appealing …

[PDF][PDF] Ride-Pooling Matching for Flexible Work: Incorporating Alternative Destinations, Facility Constraints and Group Dependencies

N Caros, J Zhao - Facility Constraints and Group Dependencies, 2022 - papers.ssrn.com
A gradual but steady growth in remote and flexible work arrangements, driven initially by
technological advances and economic forces, has been accelerated dramatically by the …