Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3308558.3313464acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Alleviating Users' Pain of Waiting: Effective Task Grouping for Online-to-Offline Food Delivery Services

Published: 13 May 2019 Publication History

Abstract

Ordering take-out food (a.k.a. takeaway food) on online-to-offline (O2O) food ordering and delivery platforms is becoming a new lifestyle for people living in big cities, thanks to its great convenience. Web users and mobile device users can order take-out food (i.e. obtain online food ordering services) on an O2O platform. Then the O2O platform will dispatch food carriers to deliver food from restaurants to users, i.e. providing users with offline food delivery services. For an O2O food ordering and delivery platform, improving food delivery efficiency, given the massive number of food orders each day and the limited number of food carriers, is of paramount importance to reducing the length of time users wait for their food. Thus, in this paper, we study the food delivery task grouping problem so as to improve food delivery efficiency and alleviate the pain of waiting for users, which to the best of our knowledge has not been studied yet. However, the food delivery task grouping problem is challenging, given two reasons. First, the food delivery efficiency is affected by multiple factors, which are non-trivial to formulate and jointly consider. Second, the problem is a typical NP-hard problem and to find near-optimal grouping results is not easy. To address these two issues, we propose an effective task grouping method. On one hand, we provide formal formulations for the factors affecting the food delivery efficiency, and provide an objective to organically combine these factors such that it can better guide the task grouping. On the other hand, we propose heuristic algorithms to efficiently obtain effective task grouping results, consisting of a greedy algorithm and a replacement algorithm. We evaluate our task grouping method using take-out food order data from web users and mobile device users on a real-world O2O food ordering and delivery platform. Experiment results demonstrate that our task grouping method can save ~ 16% (87 seconds) of average waiting time for each user, comparing with many baseline methods. It indicates that our method is able to significantly improve the food delivery efficiency and can provide better food delivery services for users.

References

[1]
Tolga Bektas. 2006. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(2006), 209-219.
[2]
Florian Bourse, Marc Lelarge, and Milan Vojnovic. 2014. Balanced graph edge partition. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD. 1456-1465.
[3]
Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. 2016. Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Results and Surveys. 117-158.
[4]
C. De Fabritiis, R. Ragona, and G. Valenti. 2008. Traffic estimation and prediction based on real time floating car data. In Proceedings of the 11th International IEEE Conference on Intelligent Transportation Systems.
[5]
Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 17-30.
[6]
E. Jenelius and H. N. Koutsopoulos. 2013. Travel time estimation for urban road networks using low frequency probe vehicle data.Transportation Research Part B: Methodological 53 (2013), 64-81.
[7]
David S. Johnson and Lyle A. McGeoch. 1997. The Traveling Salesman Problem: A Case Study in Local Optimization. Local Search in Combinatorial Optimisation(1997), 215-310.
[8]
George Karypis and Vipin Kumar. 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Scientific Computing 20, 1 (1998), 359-392.
[9]
John Krumm and Eric Horvitz. 2007. Predestination: Where Do You Want to Go Today?IEEE Computer 40(2007), 105-107.
[10]
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. 2012. Distributed GraphLab: A Framework for Machine Learning in the Cloud. PVLDB 5, 8 (2012), 716-727.
[11]
Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD. 135-146.
[12]
Daniel W. Margo and Margo I. Seltzer. 2015. A Scalable Distributed Graph Partitioner. PVLDB 8, 12 (2015), 1478-1489.
[13]
Microsoft. 2019. Microsoft solver foundation reference manual. https://msdn.microsoft.com/en-us/library/ff524499(v=vs.93).aspx.
[14]
Kyoko Miura, Katrina Giskes, and Gavin Turrell. 2009. Socioeconomic differences in takeaway food consumption and their contribution to inequalities in dietary intakes. Journal of Epidemiology & Community Health 63, 10 (2009), 820-826.
[15]
Kyoko Miura, Katrina Giskes, and Gavin Turrell. 2011. Contribution of take-out food consumption to socioeconomic differences in fruit and vegetable intake : a mediation analysis. Journal of The American Dietetic Association 111, 10(2011), 1556-1562.
[16]
Gurobi optimization. 2019. Gurobi optimizer reference manual. http://www.gurobi.com.
[17]
Fabio Petroni, Leonardo Querzoni, Khuzaima Daudjee, Shahin Kamali, and Giorgio Iacoboni. 2015. HDRF: Stream-Based Partitioning for Power-Law Graphs. In Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015. 243-252.
[18]
Jason W. Powell, Yan Huang, Favyen Bastani, and Minhe Ji. 2011. Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps. In Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD. 242-260.
[19]
Ce´sar Rego, Dorabela Gamboa, Fred Glover, and Colin Osterman. 2011. Traveling salesman problem heuristics: Leading methods, implementations and latest advances. European Journal of Operational Research 211, 3 (2011), 427-441.
[20]
Daniel J. Rosenkrantz, Richard Edwin Stearns, and Philip M. Lewis II. 1974. Approximate Algorithms for the Traveling Salesperson Problem. In 15th Annual Symposium on Switching and Automata Theory. 33-42.
[21]
Helmut Schröder, Montserrat Fïto, and Maria Isabel Covas. 2007. Association of fast food consumption with energy intake, diet quality, body mass index and the risk of obesity in a representative Mediterranean population. British Journal of Nutrition 98 (2007), 1274-1280.
[22]
Kylie J Smith, Sarah A McNaughton, Seana L Gall, Leigh Blizzard, Terence Dwyer, and Alison J Venn. 2009. Takeaway food consumption and its associations with diet quality and abdominal obesity: a cross-sectional study of young adults. International Journal of Behavioral Nutrition and Physical Activity 6, 29(2009).
[23]
Gavin Turrell and Katrina Giskes. 2008. Socioeconomic disadvantage and the purchase of takeaway food: a multilevel analysis. Appetite 51, 1 (2008), 69-81.
[24]
Yilun Wang, Yu Zheng, and Yexiang Xue. 2014. Travel time estimation of a path using sparse trajectories. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 25-34.
[25]
Wikipedia. 2019. Online take-out food ordering platform 1 in China. https://en.wikipedia.org/wiki/Ele.me.
[26]
Wikipedia. 2019. Online take-out food ordering platform 2 in China. https://en.wikipedia.org/wiki/Meituan-Dianping.
[27]
Cong Xie, Ling Yan, Wu-Jun Li, and Zhihua Zhang. 2014. Distributed Power-law Graph Computing: Theoretical and Empirical Analysis. In Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014. 1673-1681.
[28]
Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie, and Guangzhong Sun. 2010. An Interactive-Voting Based Map Matching Algorithm. In Eleventh International Conference on Mobile Data Management, MDM. 43-52.
[29]
Nicholas Jing Yuan, Yu Zheng, and Xing Xie. 2012. Segmentation of Urban Areas Using Road Networks. MSR-TR 65 (July 2012).
[30]
Chenzi Zhang, Fan Wei, Qin Liu, Zhihao Gavin Tang, and Zhenguo Li. 2017. Graph Edge Partitioning via Neighborhood Heuristic. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD. 605-614.
[31]
Yu Zheng. 2015. Trajectory Data Mining: An Overview. ACM Transaction on Intelligent Systems and Technology 6, 3 (2015), 29:1-29:41.
[32]
Yu Zheng, Lizhu Zhang, Xing Xie, and Wei-Ying Ma. 2012. Mining interesting locations and travel sequences from GPS trajectories. In Proceedings of the 18th International Conference on World Wide Web, WWW. 17-30.

Cited By

View all
  • (2025)Cross regional online food delivery: Service quality optimization and real-time order assignmentComputers & Operations Research10.1016/j.cor.2024.106877173(106877)Online publication date: Jan-2025
  • (2024)Bayesian Modeling of Travel Times on the Example of Food Delivery: Part 1—Spatial Data Analysis and ProcessingElectronics10.3390/electronics1317338713:17(3387)Online publication date: 26-Aug-2024
  • (2024)Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One AssignmentsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671643(5363-5374)Online publication date: 25-Aug-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WWW '19: The World Wide Web Conference
May 2019
3620 pages
ISBN:9781450366748
DOI:10.1145/3308558
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]

In-Cooperation

  • IW3C2: International World Wide Web Conference Committee

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 May 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Mobile applications
  2. O2O food delivery services
  3. graph edge partition
  4. optimization
  5. task grouping

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

WWW '19
WWW '19: The Web Conference
May 13 - 17, 2019
CA, San Francisco, USA

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)48
  • Downloads (Last 6 weeks)8
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Cross regional online food delivery: Service quality optimization and real-time order assignmentComputers & Operations Research10.1016/j.cor.2024.106877173(106877)Online publication date: Jan-2025
  • (2024)Bayesian Modeling of Travel Times on the Example of Food Delivery: Part 1—Spatial Data Analysis and ProcessingElectronics10.3390/electronics1317338713:17(3387)Online publication date: 26-Aug-2024
  • (2024)Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One AssignmentsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671643(5363-5374)Online publication date: 25-Aug-2024
  • (2024)LaDe: The First Comprehensive Last-mile Express Dataset from IndustryProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671548(5991-6002)Online publication date: 25-Aug-2024
  • (2024)DECO: Cooperative Order Dispatching for On-Demand Delivery with Real-Time Encounter DetectionProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3680084(4734-4742)Online publication date: 21-Oct-2024
  • (2024)Time-Constrained Actor-Critic Reinforcement Learning for Concurrent Order Dispatch in On-Demand DeliveryIEEE Transactions on Mobile Computing10.1109/TMC.2023.334281523:8(8175-8192)Online publication date: Aug-2024
  • (2024)Decision models for order fulfillment processes of online food delivery platforms: a systematic reviewInternational Journal of Production Research10.1080/00207543.2024.2440747(1-39)Online publication date: 16-Dec-2024
  • (2024)Niche-based Memetic algorithm with adaptive parameters for optimizing order delivery strategies in O2O platformsApplied Intelligence10.1007/s10489-024-06006-855:2Online publication date: 9-Dec-2024
  • (2023)Quality of Service Aware Order Allocation for Inter-Regional Online Food Delivery Systems2023 25th International Conference on Advanced Communication Technology (ICACT)10.23919/ICACT56868.2023.10079492(358-364)Online publication date: 19-Feb-2023
  • (2023)OPTI: Order Preparation Time Inference for On-demand DeliveryACM Transactions on Sensor Networks10.1145/359261019:4(1-18)Online publication date: 13-Apr-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media