{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:04:54Z","timestamp":1781607894269,"version":"3.54.5"},"reference-count":47,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:00:00Z","timestamp":1715299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71872038"],"award-info":[{"award-number":["71872038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71832001"],"award-info":[{"award-number":["71832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems"],"abstract":"<jats:p>In this paper, we study the dynamic meal delivery routing problem (MDRP) with time-sensitive customers. The multi-objective MDRP optimization model is developed to maximize customer satisfaction and minimize delay penalty cost and riding cost. To solve the dynamic MDRP, a novel waiting strategy is proposed to divide the dynamic problem into a series of static subproblems. This waiting strategy utilizes the decision threshold to determine rerouting points based on the number of dynamic meal orders. Meanwhile, time-sensitive priority is introduced to accelerate assignment and routing decisions for orders from customers with high time sensitivity. For each static subproblem, a hybrid AGA\u2013ALNS algorithm that incorporates the adaptive genetic algorithm and adaptive large neighborhood search is developed to improve both the global and local search capabilities of the genetic algorithm. We validate the performance of the proposed waiting strategy and the AGA\u2013ALNS algorithm through numerical instances. In addition, managerial insights are obtained from sensitivity analysis experiments.<\/jats:p>","DOI":"10.3390\/systems12050170","type":"journal-article","created":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T08:33:03Z","timestamp":1715589183000},"page":"170","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Waiting Strategy for the Dynamic Meal Delivery Routing Problem with Time-Sensitive Customers Using a Hybrid Adaptive Genetic Algorithm and Adaptive Large Neighborhood Search Algorithm"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8405-8282","authenticated-orcid":false,"given":"Wenjie","family":"Wang","sequence":"first","affiliation":[{"name":"Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shen","family":"Gao","sequence":"additional","affiliation":[{"name":"Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,10]]},"reference":[{"key":"ref_1","unstructured":"CCFA, and NSRC (2024, February 29). Report on the Digitization of Chinese Life Services in 2022. Available online: http:\/\/www.aliresearch.com\/ch\/presentation\/presentiondetails?articleCode=380527674285756416&type=%E6%8A%A5%E5%91%8A&organName=."},{"key":"ref_2","unstructured":"Statista (2024, February 29). Online Food Delivery-Worldwide. Available online: https:\/\/statista.com\/outlook\/374\/100\/online-food-delivery\/worldwide."},{"key":"ref_3","unstructured":"Meituan (2024, February 29). Meituan Q3 2023 Financial Report. Available online: https:\/\/www.meituan.com\/news\/NN231128062002354."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2412","DOI":"10.1287\/mnsc.2015.2236","article-title":"Optimal Price\/Lead-Time Menus for Queues with Customer Choice: Segmentation, Pooling, and Strategic Delay","volume":"62","author":"Afeche","year":"2016","journal-title":"Manag. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.ijpe.2013.05.003","article-title":"Scheduling and optimal delivery time quotation for customers with time sensitive demand","volume":"145","author":"Jin","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1287\/opre.2020.1983","article-title":"Technical Note-Pricing and Prioritization in a Duopoly with Self-Selecting, Heterogeneous, Time-Sensitive Customers Under Low Utilization","volume":"68","author":"Sainathan","year":"2020","journal-title":"Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/trsc.2020.1000","article-title":"The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times","volume":"55","author":"Ulmer","year":"2021","journal-title":"Transp. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1287\/trsc.2018.0887","article-title":"Provably High-Quality Solutions for the Meal Delivery Routing Problem","volume":"53","author":"Yildiz","year":"2019","journal-title":"Transp. Sci."},{"key":"ref_9","unstructured":"Iresearch (2024, February 29). Report on the Trends of Chinese Immediate Delivery Industry in 2022. Available online: https:\/\/www.iresearch.com.cn\/Detail\/report?id=3964&isfree=0."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"110039","DOI":"10.1016\/j.cie.2024.110039","article-title":"The restaurant delivery problem with uncertain cooking time and travel time","volume":"190","author":"Xue","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.3390\/jtaer18040091","article-title":"The Meal Delivery Routing Problem in E-commerce Platforms under the Shared Logistics Mode","volume":"18","author":"Bi","year":"2023","journal-title":"J. Theor. Appl. Electron. Commer. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"104055","DOI":"10.1016\/j.trc.2023.104055","article-title":"Crowdsourced on-demand food delivery: An order batching and assignment algorithm","volume":"149","author":"Simoni","year":"2023","journal-title":"Transp. Res. Pt. C Emerg. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"9711074","DOI":"10.1155\/2022\/9711074","article-title":"Two-Stage Solution for Meal Delivery Routing Optimization on Time-Sensitive Customer Satisfaction","volume":"2022","author":"Wang","year":"2022","journal-title":"J. Adv. Transp."},{"key":"ref_14","first-page":"2018","article-title":"The meal delivery routing problem","volume":"6571","author":"Reyes","year":"2018","journal-title":"Optim. Online"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"120627","DOI":"10.1016\/j.jclepro.2020.120627","article-title":"Multi-objective green meal delivery routing problem based on a two-stage solution strategy","volume":"258","author":"Liao","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.tre.2018.09.001","article-title":"Delivering meals for multiple suppliers: Exclusive or sharing logistics service","volume":"118","author":"Wang","year":"2018","journal-title":"Transp. Res. Pt. E Logist. Transp. Rev."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"6842","DOI":"10.1109\/JIOT.2019.2930984","article-title":"OCD: Online crowdsourced delivery for on-demand food","volume":"7","author":"Tu","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"101115","DOI":"10.1016\/j.elerap.2021.101115","article-title":"Emerging technology-based online scheduling for instant delivery in the O2O retail era","volume":"51","author":"Chen","year":"2022","journal-title":"Electron. Commer. Res. Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"106337","DOI":"10.1016\/j.cor.2023.106337","article-title":"Disruption Recovery for the Pickup and Delivery Problem with Time Windows\u2014A Scenario-based Approach for Online Food Delivery","volume":"159","author":"Hu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","article-title":"Dynamic pickup and delivery problems","volume":"202","author":"Berbeglia","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","article-title":"Waiting strategies for the dynamic pickup and delivery problem with time windows","volume":"38","author":"Laporte","year":"2004","journal-title":"Transp. Res. Pt. B Methodol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.1040.0124","article-title":"Scenario-based planning for partially dynamic vehicle routing with stochastic customers","volume":"52","author":"Bent","year":"2004","journal-title":"Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.dss.2012.06.007","article-title":"An event-driven optimization framework for dynamic vehicle routing","volume":"54","author":"Pillac","year":"2012","journal-title":"Decis. Support Syst."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"113959","DOI":"10.1016\/j.eswa.2020.113959","article-title":"Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm","volume":"165","author":"Park","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10479-014-1683-6","article-title":"Distribution of waiting time for dynamic pickup and delivery problems","volume":"236","author":"Vonolfen","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_26","first-page":"55","article-title":"On dynamic demand responsive transport services with degree of dynamism","volume":"10","author":"Wong","year":"2014","journal-title":"Transp. A"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"105896","DOI":"10.1016\/j.cor.2022.105896","article-title":"A branch-and-price algorithm for a routing problem with inbound and outbound requests","volume":"146","author":"Agius","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"106426","DOI":"10.1016\/j.cor.2023.106426","article-title":"A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem","volume":"161","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","article-title":"A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery","volume":"65","author":"Goksal","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Tan, Z., Zhen, L., Yang, Z., Liu, L., and Fan, T. (2023). Multi-period emergency vehicle fleet redistribution and dispatching. Transp. A, 1\u201333.","DOI":"10.1080\/23249935.2023.2243344"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"17011","DOI":"10.1007\/s00500-023-08378-4","article-title":"4PL routing problem using hybrid beetle swarm optimization","volume":"27","author":"Lu","year":"2023","journal-title":"Soft Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","article-title":"A genetic algorithm for the simultaneous delivery and pickup problems with time window","volume":"62","author":"Wang","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"120807","DOI":"10.1016\/j.eswa.2023.120807","article-title":"A Multi-Depot Vehicle Routing Problem with Time Windows, Split Pickup and Split Delivery for Surplus Food Recovery and Redistribution","volume":"232","author":"Dubey","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"105698","DOI":"10.1016\/j.cor.2022.105698","article-title":"A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times","volume":"141","author":"Zarouk","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"103584","DOI":"10.1016\/j.engappai.2020.103584","article-title":"Two-level principal-agent model for schedule risk control of IT outsourcing project based on genetic algorithm","volume":"91","author":"Bi","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"116690","DOI":"10.1016\/j.eswa.2022.116690","article-title":"Collaborative multicenter vehicle routing problem with time windows and mixed deliveries and pickups","volume":"197","author":"Wang","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_37","first-page":"2103205","article-title":"Multi-objective optimization for multi-depot heterogeneous first-mile transportation system considering requests\u2019 preference ranks for pick-up stops","volume":"19","author":"Ren","year":"2023","journal-title":"Transp. A"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"102124","DOI":"10.1016\/j.tre.2020.102124","article-title":"A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem","volume":"150","author":"Zhan","year":"2021","journal-title":"Transp. Res. Pt. E Logist. Transp. Rev."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"102891","DOI":"10.1016\/j.tre.2022.102891","article-title":"The dynamic ride-hailing sharing problem with multiple vehicle types and user classes","volume":"168","author":"Zhan","year":"2022","journal-title":"Transp. Res. Pt. E Logist. Transp. Rev."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","article-title":"Multi-objective genetic algorithms for vehicle routing problem with time windows","volume":"24","author":"Ombuki","year":"2006","journal-title":"Appl. Intell."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"109225","DOI":"10.1016\/j.asoc.2022.109225","article-title":"Routing and scheduling optimization for UAV assisted delivery system: A hybrid approach","volume":"126","author":"Sajid","year":"2022","journal-title":"Appl. Soft. Comput."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"105436","DOI":"10.1016\/j.cor.2021.105436","article-title":"Scheduling local and express trains in suburban rail transit lines: Mixed\u2013integer nonlinear programming and adaptive genetic algorithm","volume":"135","author":"Tang","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2017.01.047","article-title":"On solving periodic re-optimization dynamic vehicle routing problems","volume":"55","author":"AbdAllah","year":"2017","journal-title":"Appl. Soft. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"114307","DOI":"10.1016\/j.eswa.2020.114307","article-title":"An integrated modeling method for collaborative vehicle routing: Facilitating the unmanned micro warehouse pattern in new retail","volume":"168","author":"Wang","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"106462","DOI":"10.1016\/j.asoc.2020.106462","article-title":"Green vehicle routing and scheduling problem with heterogeneous fleet including reverse logistics in the form of collecting returned goods","volume":"94","author":"Foroutan","year":"2020","journal-title":"Appl. Soft. Comput."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Xie, F., Chen, Z., and Zhang, Z. (2024). Research on Dynamic Takeout Delivery Vehicle Routing Problem under Time-Varying Subdivision Road Network. Mathematics, 12.","DOI":"10.3390\/math12070962"}],"container-title":["Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/5\/170\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:43:35Z","timestamp":1760107415000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/5\/170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,10]]},"references-count":47,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["systems12050170"],"URL":"https:\/\/doi.org\/10.3390\/systems12050170","relation":{},"ISSN":["2079-8954"],"issn-type":[{"value":"2079-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,10]]}}}