A survey of dial-a-ride problems: Literature review and recent developments

SC Ho, WY Szeto, YH Kuo, JMY Leung… - … Research Part B …, 2018 - Elsevier
There has been a resurgence of interest in demand-responsive shared-ride systems,
motivated by concerns for the environment and also new developments in technologies …

A unified approach to route planning for shared mobility

Y Tong, Y Zeng, Z Zhou, L Chen… - Proceedings of the …, 2018 - ink.library.smu.edu.sg
There has been a dramatic growth of shared mobility applications such as ride-sharing, food
delivery and crowdsourced parcel delivery. Shared mobility refers to transportation services …

Online graph algorithms with predictions

Y Azar, D Panigrahi, N Touitou - Proceedings of the 2022 Annual ACM-SIAM …, 2022 - SIAM
Online algorithms with predictions is a popular and elegant framework for bypassing
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …

Unified route planning for shared mobility: An insertion-based framework

Y Tong, Y Zeng, Z Zhou, L Chen, K Xu - ACM Transactions on Database …, 2022 - dl.acm.org
There has been a dramatic growth of shared mobility applications such as ride-sharing, food
delivery, and crowdsourced parcel delivery. Shared mobility refers to transportation services …

Last-mile delivery made practical: An efficient route planning framework with theoretical guarantees

Y Zeng, Y Tong, L Chen - Proceedings of the VLDB Endowment, 2019 - dl.acm.org
Last-mile delivery (LMD) refers to the movement of goods from transportation origins to the
final destinations. It has widespread applications such as urban logistics, e-commerce, etc …

Matching and routing for shared autonomous vehicles in congestible network

Q Ge, K Han, X Liu - Transportation research part E: logistics and …, 2021 - Elsevier
The dispatch and routing problems of shared autonomous vehicle (DR-SAV) have been
widely studied, and one of the key challenges is the modeling complexity and computational …

Demand-aware route planning for shared mobility services

J Wang, P Cheng, L Zheng, C Feng, L Chen… - Proceedings of the …, 2020 - dl.acm.org
The dramatic development of shared mobility in food delivery, ridesharing, and
crowdsourced parcel delivery has drawn great concerns. Specifically, shared mobility refers …

The strongish planted clique hypothesis and its consequences

P Manurangsi, A Rubinstein, T Schramm - arXiv preprint arXiv:2011.05555, 2020 - arxiv.org
We formulate a new hardness assumption, the Strongish Planted Clique Hypothesis
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …

Improved approximation algorithms for directed steiner forest

M Feldman, G Kortsarz, Z Nutov - Journal of Computer and System …, 2012 - Elsevier
We consider the k-Directed Steiner Forest (k-DSF) problem: Given a directed graph G=(V, E)
with edge costs, a collection D⊆ V× V of ordered node pairs, and an integer k⩽| D|, find a …

Online Ridesharing with Meeting Points [Technical Report]

J Wang, P Cheng, L Zheng, L Chen… - arXiv preprint arXiv …, 2022 - arxiv.org
Nowadays, ridesharing becomes a popular commuting mode. Dynamically arriving riders
post their origins and destinations, then the platform assigns drivers to serve them. In …