{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:53:11Z","timestamp":1753181591422,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030845285"},{"type":"electronic","value":"9783030845292"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-84529-2_29","type":"book-chapter","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T15:01:42Z","timestamp":1628521302000},"page":"340-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Online Food Delivery Problem via an Effective Hybrid Algorithm with Intelligent Batching Strategy"],"prefix":"10.1007","author":[{"given":"Xing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shengyao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jing-fang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"29_CR1","unstructured":"Meituan Delivery Homepage. https:\/\/peisong.meituan.com\/about. Accessed 20 Mar 2021"},{"key":"29_CR2","unstructured":"The changing market for food delivery. https:\/\/www.mckinsey.com\/industries\/high-tech\/our-insights\/the-changing-market-for-food-delivery. Accessed 3 Dec 2020"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","volume":"22","author":"B Kalantari","year":"1985","unstructured":"Kalantari, B., Hill, A.V., Arora, S.R.: An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. 22(3), 377\u2013386 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414\u2013426 (2011)","journal-title":"Oper. Res."},{"issue":"12","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1016\/j.cor.2011.02.009","volume":"38","author":"P Venkateshan","year":"2011","unstructured":"Venkateshan, P., Mathur, K.: An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Comput. Oper. Res. 38(12), 1647\u20131655 (2011)","journal-title":"Comput. Oper. Res."},{"key":"29_CR6","unstructured":"Lim, H., Lim, A., Rodrigues, B.: Solving the pickup and delivery problem with time windows using \u201csqueaky wheel\u201d optimization with local search. In: AIS (2002)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.ejor.2005.05.012","volume":"175","author":"Q Lu","year":"2006","unstructured":"Lu, Q., Dessouky, M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. Eur. J. Oper. Res. 175(2), 672\u2013687 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"03","key":"29_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0218213002000988","volume":"11","author":"HC Lau","year":"2002","unstructured":"Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(03), 455\u2013472 (2002)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Lu, Y., Wu, Y., Zhou, Y.: Order assignment and routing for online food delivery: two meta-heuristic methods. In: Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, pp. 125\u2013129 (2017)","DOI":"10.1145\/3059336.3059349"},{"issue":"02","key":"29_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"12","author":"H Li","year":"2003","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(02), 173\u2013186 (2003)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/trsc.2020.1000","volume":"55","author":"MW Ulmer","year":"2021","unstructured":"Ulmer, M.W., Thomas, B.W., Campbell, A.M., Woyak, N.: The restaurant meal delivery problem: dynamic pickup and delivery with deadlines and random ready times. Transp. Sci. 55(1), 75\u2013100 (2021)","journal-title":"Transp. Sci."},{"key":"29_CR13","unstructured":"Reyes, D., Erera, A., Savelsbergh, M., Sahasrabudhe, S., O\u2019Neil, R.: The meal delivery routing problem. Optimization Online (2018)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, Q., et al.: Two fast heuristics for online order dispatching. In: 2020 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185791"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Indus. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Indus. Appl. Math."},{"issue":"12","key":"29_CR17","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1145\/362919.362945","volume":"14","author":"F Bourgeois","year":"1971","unstructured":"Bourgeois, F., Lassalle, J.C.: An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Commun. ACM 14(12), 802\u2013804 (1971)","journal-title":"Commun. ACM"},{"issue":"7","key":"29_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3390\/info9070149","volume":"9","author":"SS Dhaliwal","year":"2018","unstructured":"Dhaliwal, S.S., Nahid, A.A., Abbas, R.: Effective intrusion detection system using XGBoost. Information 9(7), 149 (2018)","journal-title":"Information"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: An effective iterated greedy algorithm for online route planning problem. In: 2020 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185864"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84529-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:09:09Z","timestamp":1710256149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84529-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030845285","9783030845292"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84529-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2021\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}