A survey of dial-a-ride problems: Literature review and recent developments
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 …
motivated by concerns for the environment and also new developments in technologies …
A unified approach to route planning for shared mobility
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 …
delivery and crowdsourced parcel delivery. Shared mobility refers to transportation services …
Online graph algorithms with predictions
Online algorithms with predictions is a popular and elegant framework for bypassing
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
Unified route planning for shared mobility: An insertion-based framework
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 …
delivery, and crowdsourced parcel delivery. Shared mobility refers to transportation services …
Last-mile delivery made practical: An efficient route planning framework with theoretical guarantees
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 …
final destinations. It has widespread applications such as urban logistics, e-commerce, etc …
Matching and routing for shared autonomous vehicles in congestible network
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 …
widely studied, and one of the key challenges is the modeling complexity and computational …
Demand-aware route planning for shared mobility services
The dramatic development of shared mobility in food delivery, ridesharing, and
crowdsourced parcel delivery has drawn great concerns. Specifically, shared mobility refers …
crowdsourced parcel delivery has drawn great concerns. Specifically, shared mobility refers …
The strongish planted clique hypothesis and its consequences
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 …
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …
Improved approximation algorithms for directed steiner forest
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 …
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]
Nowadays, ridesharing becomes a popular commuting mode. Dynamically arriving riders
post their origins and destinations, then the platform assigns drivers to serve them. In …
post their origins and destinations, then the platform assigns drivers to serve them. In …