{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:43:42Z","timestamp":1765547022881,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251573"},{"type":"electronic","value":"9783031251580"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25158-0_23","type":"book-chapter","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:37:20Z","timestamp":1676324240000},"page":"296-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Vehicle-Cargo Matching Based on\u00a0Adaptive Time Windows"],"prefix":"10.1007","author":[{"given":"Chong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Jiajun","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Jiali","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Jiaye","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 1253\u20131264 (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"23_CR2","first-page":"1","volume":"81","author":"I Ashlagi","year":"2017","unstructured":"Ashlagi, I., et al.: Min-cost bipartite perfect matching with delays. APPROX\/RANDOM 81, 1\u20131 (2017)","journal-title":"APPROX\/RANDOM"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1051\u20131061 (2017)","DOI":"10.1137\/1.9781611974782.67"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Z., Cheng, P., Zeng, Y., Chen, L.: Minimizing maximum delay of task assignment in spatial crowdsourcing. In: ICDE, pp. 1454\u20131465 (2019)","DOI":"10.1109\/ICDE.2019.00131"},{"key":"23_CR5","unstructured":"Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Assigning tasks to workers based on historical data: online task assignment with two-sided arrivals. In: AAMAS (2018)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dss.2013.12.001","volume":"59","author":"Z Hu","year":"2014","unstructured":"Hu, Z., Sheng, Z.: A decision support system for public logistics information service management and optimization. Decis. Support Syst. 59, 219\u2013229 (2014)","journal-title":"Decis. Support Syst."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Huang, Z., Kang, N., Tang, Z.G., Wu, X., Zhang, Y., Zhu, X.: How to match when all vertices arrive online. In: ACM SIGACT Symposium on Theory of Computing, pp. 17\u201329 (2018)","DOI":"10.1145\/3188745.3188858"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"issue":"1\u20132","key":"23_CR9","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(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art, pp. 105\u2013132. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_5","DOI":"10.1007\/978-3-540-68279-0_5"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-59419-0_42","volume-title":"Database Systems for Advanced Applications","author":"J Liu","year":"2020","unstructured":"Liu, J., et al.: Adaptive loading plan decision based upon limited transport capacity. In: Nah, Y., Cui, B., Lee, S.-W., Yu, J.X., Moon, Y.-S., Whang, S.E. (eds.) DASFAA 2020. LNCS, vol. 12114, pp. 685\u2013697. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59419-0_42"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/trsc.1030.0073","volume":"38","author":"MZ Spivey","year":"2004","unstructured":"Spivey, M.Z., Powell, W.B.: The dynamic assignment problem. Transp. Sci. 38(4), 399\u2013419 (2004)","journal-title":"Transp. Sci."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Sun, Y., Zhang, J., Tang, Q., Yan, Y.: Research on benefit-risk of vehicle-cargo matching platform based on matching degree. In: ICITE, pp. 580\u2013584. IEEE (2020)","DOI":"10.1109\/ICITE50838.2020.9231375"},{"issue":"12","key":"23_CR14","first-page":"1053","volume":"9","author":"Y Tong","year":"2016","unstructured":"Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. VLDB 9(12), 1053\u20131064 (2016)","journal-title":"VLDB"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowdsourcing. In: ICDE, pp. 49\u201360 (2016)","DOI":"10.1109\/ICDE.2016.7498228"},{"issue":"11","key":"23_CR16","first-page":"1334","volume":"10","author":"Y Tong","year":"2017","unstructured":"Tong, Y., et al.: Flexible online task assignment in real-time spatial data. VLDB 10(11), 1334\u20131345 (2017)","journal-title":"VLDB"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wong, S.C.W.: Two-sided online bipartite matching and vertex cover: beating the greedy algorithm. In: ICALP, pp. 1070\u20131081 (2015)","DOI":"10.1007\/978-3-662-47672-7_87"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Y., Tong, Y., Long, C., Xu, P., Xu, K., Lv, W.: Adaptive dynamic bipartite graph matching: a reinforcement learning approach. In: ICDE, pp. 1478\u20131489 (2019)","DOI":"10.1109\/ICDE.2019.00133"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25158-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T19:09:31Z","timestamp":1689880171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25158-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251573","9783031251580"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25158-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}