research-article

Public Access

Minimizing Latency in Online Ride and Delivery Services

Authors:

Sreenivas Gollapudi,

Debmalya Panigrahi,

Chaitanya SwamyAuthors Info & Claims

WWW '18: Proceedings of the 2018 World Wide Web Conference

Pages 379 - 388

https://doi.org/10.1145/3178876.3186104

Published: 23 April 2018 Publication History

All formats PDF

Abstract

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.

References

[1]

Hernán Abeledo, Ricardo Fukasawa, Artur Pessoa, and Eduardo Uchoa. 2013. The time dependent traveling salesman problem: polyhedra and algorithm. Mathematical Programming Computation 5, 1 (01 Mar 2013), 27--55.

[2]

Aamena Alshamsi, Sherief Abdallah, and Iyad Rahwan. 2009. Multiagent Selforganization for a Taxi Dispatch System. In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '09).

[3]

F. Angel-Bello, Y. Cardona-Valdé A. Á. 2017. Mixed integer formulations for the multiple minimum latency problem. Operational Research (08 Feb 2017).

[4]

Aaron Archer and Anna Blasiak. 2010. Improved Approximation Algorithms for the Minimum Latency Problem via Prize-collecting Strolls. In Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 429--447. http://dl.acm.org/citation.cfm?id=1873601.1873637

Digital Library

[5]

Aaron Archer, Asaf Levin, and David P. Williamson. 2008. A Faster, Better Approximation Algorithm for the Minimum Latency Problem. SIAM J. Comput. 37, 5 (2008), 1472--1498.

Digital Library

[6]

Sanjeev Arora and George Karakostas. 2003. Approximation Schemes for Minimum Latency Problems. SIAM J. Comput. 32, 5 (2003), 1317--1337.

Digital Library

[7]

Giorgio Ausiello, Stefano Leonardi, and Alberto Marchetti-Spaccamela. 2000. On Salesmen, Repairmen, Spiders, and Other Traveling Agents. Springer Berlin Heidelberg, Berlin, Heidelberg, 1--16.

Digital Library

[8]

Avrim Blum, Prasad Chalasani, Don Coppersmith, Bill Pulleyblank, Prabhakar Raghavan, and Madhu Sudan. 1994. The Minimum Latency Problem. In Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing (STOC '94). ACM, New York, NY, USA, 163--171.

Digital Library

[9]

Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, and Kunal Talwar. 2003. Paths, Trees, and Minimum Latency Tours. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS '03). IEEE Computer Society, Washington, DC, USA, 36--. http://dl.acm.org/citation.cfm?id=946243. 946316 Chandra Chekuri, Nitish Korula, and Martin Pá2. Improved Algorithms for Orienteering and Related Problems. ACM Trans. Algorithms 8, 3, Article 23 (July 2012), 27 pages.

Digital Library

[10]

Chandra Chekuri and Amit Kumar. 2004. Maximum Coverage Problem with Group Budget Constraints and Applications. Springer Berlin Heidelberg, Berlin, Heidelberg, 72--83.

[11]

Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, and Chaitanya Swamy. 2018. Minimizing Latency in Online Ride and Delivery Services. (Feb 2018). Available at https://arxiv.org/abs/1802.02744.

Digital Library

[12]

Willem E. de Paepe, Jan Karel Lenstra, Jiri Sgall, Ren A. Sitters, and Leen Stougie. 2004. Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS Journal on Computing 16, 2 (2004), 120--132.

Digital Library

[13]

Jittat Fakcharoenphol, Chris Harrelson, and Satish Rao. 2003. The K-traveling Repairman Problem. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 655--664. http://dl.acm.org/citation.cfm? id=644108.644215

Digital Library

[14]

Michel Goemans and Jon Kleinberg. 1996. An Improved Approximation Ratio for the Minimum Latency Problem. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '96). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 152--158. http://dl.acm.org/citation.cfm? id=313852.313909

Digital Library

[15]

R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.Rinnooy Kan. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In Discrete Optimization II, P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol. 5. Elsevier, 287 -- 326.

[16]

Elias Koutsoupias, Christos Papadimitriou, and Mihalis Yannakakis. 1996. Searching a fixed graph. Springer Berlin Heidelberg, Berlin, Heidelberg, 280--289.

Digital Library

[17]

Zhixing Luo, Hu Qin, and Andrew Lim. 2014. Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. European Journal of Operational Research 234, 1 (2014), 49--60. https://EconPapers.repec.org/RePEc: eee:ejores:v:234:y:2014:i:1:p:49--60

[18]

Isabel Méndez-Diaz, Paula Zabala, and Abilio Lucena. 2008. A New Formulation for the Traveling Deliveryman Problem. Discrete Appl. Math. 156, 17 (Oct. 2008), 3223--3237.

Digital Library

[19]

Nenad Mladenović, Dragan Urosević, and Said Hanafi. 2013. Variable neighborhood search for the travelling deliveryman problem. 4 11, 1 (01 Mar 2013), 57--73.

[20]

Samuel Nucamendi-Guillèn, Iris Martinez-Salazar, Francisco Angel-Bello, and J Marcos Moreno-Vega. 2016. A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem. Journal of the Operational Research Society 67, 8 (01 Aug 2016), 1121--1134.

[21]

Christos H. Papadimitriou and Mihalis Yannakakis. 1993. The Traveling Salesman Problem with Distances One and Two. Math. Oper. Res. 18, 1 (Feb. 1993), 1--11.

[22]

Ian Post and Chaitanya Swamy. 2015. Linear Programming-based Approximation Algorithms for Multi-vehicle Minimum Latency Problems. In Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '15). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 512--531. http://dl.acm.org/citation.cfm?id=2722129.2722164

Digital Library

[23]

Shiyou Qian, Jian Cao, Frèdèric Le Mouël, Issam Sahel, and Minglu Li. 2015. SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15). ACM, New York, NY, USA, 955--964.

Digital Library

[24]

Meng Qu, Hengshu Zhu, Junming Liu, Guannan Liu, and Hui Xiong. 2014. A Costeffective Recommender System for Taxi Drivers. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '14). ACM, New York, NY, USA, 45--54.

Digital Library

[25]

Sartaj Sahni and Teofilo Gonzalez. 1976. P-Complete Approximation Problems. J. ACM 23, 3 (July 1976), 555--565.

Digital Library

[26]

Douglas O. Santos and Eduardo C. Xavier. 2013. Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI '13). AAAI Press, 2885--2891. http://dl.acm.org/citation.cfm?id=2540128.2540544

Digital Library

[27]

Marcos Melo Silva, Anand Subramanian, Thibaut Vidal, and Luiz Satoru Ochi. 2012. A simple and effective metaheuristic for the Minimum Latency Problem. European Journal of Operational Research 221, 3 (2012), 513 -- 520.

[28]

Renè Sitters. 2002. The Minimum Latency Problem Is NP-Hard forWeighted Trees. In Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag, London, UK, UK, 230--239. http://dl.acm.org/citation.cfm?id=645591.660083

Digital Library

[29]

Renè Sitters. 2014. Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems. In Proceedings of the Twentyfifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '14). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 604--616. http: //dl.acm.org/citation.cfm?id=2634074.2634120

Digital Library

[30]

M. Skutella. 2006. List Scheduling in Order of a-Points on a Single Machine. In Efficient Approximation and Online Algorithms. Springer, 250--291.

Digital Library

[31]

John N. Tsitsiklis. 1992. Special cases of traveling salesman and repairman problems with time windows. Networks 22, 3 (1992), 263--282.

[32]

Xianyuan Zhan, Xinwu Qian, and Satish V. Ukkusuri. 2014. Measuring the Efficiency of Urban Taxi Service System. In The Third International Workshop on Urban Computing (UrbComp '14).

[33]

Xudong Zheng, Xiao Liang, and Ke Xu. 2012. Where to Wait for a Taxi?. In Proceedings of the ACM SIGKDD International Workshop on Urban Computing (UrbComp '12). ACM, New York, NY, USA, 149--156.

Digital Library

[34]

Chenguang Zhu and Balaji Prabhakar. 2017. Reducing Inefficiencies in Taxi Systems. In Proceedings of the Fifty-Sixth IEEE Conference on Decision and Control (CDC '17).

Cited By

Zhang MZeng YWang KLi YWu QXu M(2024)Learned Unmanned Vehicle Scheduling for Large-Scale Urban LogisticsIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.335168725:7(7933-7944)Online publication date: Jul-2024
https://doi.org/10.1109/TITS.2024.3351687
Aryadi HBezerra ROhno KGunji KKojima SKuwahara MOkada YKonyo MTadokoro S(2023)Multi-Agent Pickup and Delivery in Transformable Production2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)10.1109/CASE56687.2023.10260587(1-8)Online publication date: 26-Aug-2023
https://doi.org/10.1109/CASE56687.2023.10260587
Wang WTao HJiang Y(2022)Efficient Online City-Scale Patrolling by Exploiting Offline Model-Based Coordination PolicyIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2021.312893423:8(13805-13818)Online publication date: Aug-2022
https://doi.org/10.1109/TITS.2021.3128934
Show More Cited By

Index Terms

Minimizing Latency in Online Ride and Delivery Services
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Mathematical optimization
      1. Discrete optimization

Recommendations

Passenger Trip Planning using Ride-Sharing Services
CHI '18: Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems

Ride-sharing can potentially address transportation challenges such as traffic congestion and air pollution by letting drivers share their cars unused capacity with a number of passengers. However, even though multiple ride-sharing services exist and HCI ...
Poster: Vehicle Routing with Pickup and Delivery: A Greedy Approach
CHANTS '17: Proceedings of the 12th Workshop on Challenged Networks

Recently, bicycles have become popular in large cities and many bicycle sharing companies have established their own bike sharing systems. Extra vehicles are used to transport bikes among different bike stations, such that the number of bikes in each ...
Minimum Makespan Multi-Vehicle Dial-a-Ride

Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(s_i,t_i)}^m_i=1, where each object requires to be moved from its source to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

WWW '18: Proceedings of the 2018 World Wide Web Conference

April 2018

2000 pages

ISBN:9781450356398

General Chairs:
Pierre-Antoine Champin
Universitè Claude Bernard Lyon 1, France
,
Fabien Gandon
Inria, Université Côte d'Azur, CNRS, I3S, France
,
Lionel Médini
Université Claude Bernard Lyon 1, France
,
Program Chairs:
Mounia Lalmas
Spotify, UK
,
Panagiotis G. Ipeirotis
New York University, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

IW3C2: International World Wide Web Conference Committee

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

International World Wide Web Conferences Steering Committee

Republic and Canton of Geneva, Switzerland

Publication History

Published: 23 April 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Natural Sciences and Engineering Research Council
National Science Foundation

Conference

WWW '18

Sponsor:

IW3C2

WWW '18: The Web Conference 2018

April 23 - 27, 2018

Lyon, France

Acceptance Rates

WWW '18 Paper Acceptance Rate 170 of 1,155 submissions, 15%;

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
1,042
Total Downloads

Downloads (Last 12 months)130
Downloads (Last 6 weeks)16

Reflects downloads up to 20 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang MZeng YWang KLi YWu QXu M(2024)Learned Unmanned Vehicle Scheduling for Large-Scale Urban LogisticsIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.335168725:7(7933-7944)Online publication date: Jul-2024
https://doi.org/10.1109/TITS.2024.3351687
Aryadi HBezerra ROhno KGunji KKojima SKuwahara MOkada YKonyo MTadokoro S(2023)Multi-Agent Pickup and Delivery in Transformable Production2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)10.1109/CASE56687.2023.10260587(1-8)Online publication date: 26-Aug-2023
https://doi.org/10.1109/CASE56687.2023.10260587
Wang WTao HJiang Y(2022)Efficient Online City-Scale Patrolling by Exploiting Offline Model-Based Coordination PolicyIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2021.312893423:8(13805-13818)Online publication date: Aug-2022
https://doi.org/10.1109/TITS.2021.3128934
Radakovic DSingh AVarde ALal P(2022)Enriching Smart Cities by Optimizing Electric Vehicle Ride-Sharing through Game Theory2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)10.1109/ICTAI56018.2022.00116(755-759)Online publication date: Oct-2022
https://doi.org/10.1109/ICTAI56018.2022.00116
Bezerra ROhno KKojima SAryadi HGunji KKuwahara MOkada YKonyo MTadokoro S(2022)Heterogeneous Multi-Robot Task Scheduling Heuristics for Garment Mass Customization2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)10.1109/CASE49997.2022.9926509(439-446)Online publication date: 20-Aug-2022
https://doi.org/10.1109/CASE49997.2022.9926509
Costa CNascimento M(2021)Last Mile Delivery Considering Time-Dependent LocationsProceedings of the 29th International Conference on Advances in Geographic Information Systems10.1145/3474717.3483919(121-132)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3474717.3483919
Wang WTao HJiang Y(2020)Efficient Delivery Services Sharing with Time WindowsApplied Sciences10.3390/app1021743110:21(7431)Online publication date: 22-Oct-2020
https://doi.org/10.3390/app10217431
Yu HLuo XWu T(2020)Online pickup and delivery problem with constrained capacity to minimize latencyJournal of Combinatorial Optimization10.1007/s10878-020-00615-y43:5(974-993)Online publication date: 27-Jun-2020
https://doi.org/10.1007/s10878-020-00615-y
Liu MMa HLi JKoenig SElkind EVeloso MAgmon NTaylor M(2019)Task and Path Planning for Multi-Agent Pickup and DeliveryProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331816(1152-1160)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331816
Yu HLuo X(2019)Minimizing Latency in Online Pickup and Delivery Problem with Single Pickup Point2019 International Conference on Industrial Engineering and Systems Management (IESM)10.1109/IESM45758.2019.8948173(1-6)Online publication date: Sep-2019
https://doi.org/10.1109/IESM45758.2019.8948173
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten