Minimizing latency in online ride and delivery services

Other Article

Motivated by the popularity of online ride and delivery services, we study natural variants of classical multi-vehicle minimum latency problems where the objective is to route a set of vehicles located at depots to serve requests located on a metric space so as to minimize the total latency. In this paper, we consider point-to-point requests that come with source-destination pairs and release-time constraints that restrict when each request can be served. The point-to-point requests and release-time constraints model taxi rides and deliveries. For all the variants considered, we show constant-factor approximation algorithms based on a linear programming framework. To the best of our knowledge, these are the first set of results for the aforementioned variants of the minimum latency problems. Furthermore, we provide an empirical study of heuristics based on our theoretical algorithms on a real data set of taxi rides.

Full Text

Duke Authors

Cited Authors

  • Das, A; Gollapudi, S; Kim, A; Panigrahi, D; Swamy, C

Published Date

  • April 10, 2018

Published In

  • The Web Conference 2018 Proceedings of the World Wide Web Conference, Www 2018

Start / End Page

  • 379 - 388

International Standard Book Number 13 (ISBN-13)

  • 9781450356398

Digital Object Identifier (DOI)

  • 10.1145/3178876.3186104

Citation Source

  • Scopus