{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T22:12:41Z","timestamp":1785449561927,"version":"3.56.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01551-w","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T13:04:22Z","timestamp":1673442262000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coordinating Multi-party Vehicle Routing with Location Congestion via Iterative Best Response"],"prefix":"10.1007","volume":"4","author":[{"given":"Waldy","family":"Joe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5326-411X","authenticated-orcid":false,"given":"Hoong Chuin","family":"Lau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"issue":"1","key":"1551_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.10.023","volume":"268","author":"M Gansterer","year":"2018","unstructured":"Gansterer M, Hartl RF. Collaborative vehicle routing: a survey. Eur J Oper Res. 2018;268(1):1\u201312.","journal-title":"Eur J Oper Res"},{"key":"1551_CR2","unstructured":"Brafman RI, Domshlak C. From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling, 2008;28\u201335."},{"key":"1551_CR3","doi-asserted-by":"crossref","unstructured":"Joe W, Lau HC. Coordinating multi-party vehicle routing with location congestion via iterative best response. In: Multi-Agent Systems: 18th European Conference, EUMAS 2021, Virtual Event, June 28\u201329, 2021, Revised Selected Papers, 2021; 72. Springer Nature.","DOI":"10.1007\/978-3-030-82254-5_5"},{"issue":"3","key":"1551_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s10601-016-9241-2","volume":"21","author":"E Lam","year":"2016","unstructured":"Lam E, Van Hentenryck P. A branch-and-price-and-check model for the vehicle routing problem with location congestion. Constraints. 2016;21(3):394\u2013412.","journal-title":"Constraints"},{"issue":"3","key":"1551_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke S, Cordeau J-F. Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci. 2009;43(3):267\u201386.","journal-title":"Transp Sci"},{"key":"1551_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1287\/trsc.2021.1109","volume":"52","author":"R Song","year":"2022","unstructured":"Song R, Lau HC, Luo X, Zhao L. Coordinated delivery to shopping malls with limited docking capacity. Transp Sci. 2022;52:501\u201327.","journal-title":"Transp Sci"},{"key":"1551_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.trc.2015.12.011","volume":"70","author":"DP Cuervo","year":"2016","unstructured":"Cuervo DP, Vanovermeire C, S\u00f6rensen K. Determining collaborative profits in coalitions formed by two partners with varying characteristics. Transp Res Part C: Emerg Technol. 2016;70:171\u201384.","journal-title":"Transp Res Part C: Emerg Technol"},{"issue":"1","key":"1551_CR8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ejor.2018.05.001","volume":"271","author":"M Guajardo","year":"2018","unstructured":"Guajardo M, R\u00f6nnqvist M, Flisberg P, Frisk M. Collaborative transportation with overlapping coalitions. Eur J Oper Res. 2018;271(1):238\u201349.","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"1551_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12159-011-0046-9","volume":"3","author":"B Dai","year":"2011","unstructured":"Dai B, Chen H. A multi-agent and auction-based framework and approach for carrier collaboration. Logist Res. 2011;3(2\u20133):101\u201320.","journal-title":"Logist Res"},{"issue":"2","key":"1551_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00291-013-0331-x","volume":"36","author":"X Wang","year":"2014","unstructured":"Wang X, Kopfer H. Collaborative transportation planning of less-than-truckload freight. OR Spectr. 2014;36(2):357\u201380.","journal-title":"OR Spectr"},{"issue":"6","key":"1551_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3128584","volume":"50","author":"A Torre\u00f1o","year":"2017","unstructured":"Torre\u00f1o A, Onaindia E, Komenda A, \u0160tolba M. Cooperative multi-agent planning: a survey. ACM Comput Surv (CSUR). 2017;50(6):1\u201332.","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1551_CR12","unstructured":"Nissim R, Brafman RI, Domshlak C. A general, fully distributed multi-agent planning algorithm. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: 2010;1:1323\u20131330."},{"key":"1551_CR13","unstructured":"Brafman RI, Domshlak C, Engel Y, Tennenholtz M. Planning games. In: IJCAI, 2009;73\u201378. Citeseer."},{"issue":"3","key":"1551_CR14","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/opre.1040.0178","volume":"53","author":"TJ Lambert Iii","year":"2005","unstructured":"Lambert Iii TJ, Epelman MA, Smith RL. A fictitious play approach to large-scale optimization. Oper Res. 2005;53(3):477\u201389.","journal-title":"Oper Res"},{"issue":"1","key":"1551_CR15","first-page":"374","volume":"13","author":"GW Brown","year":"1951","unstructured":"Brown GW. Iterative solution of games by fictitious play. Act Anal Prod Alloc. 1951;13(1):374\u20136.","journal-title":"Act Anal Prod Alloc"},{"issue":"2","key":"1551_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0191-2615(99)00018-1","volume":"34","author":"A Garcia","year":"2000","unstructured":"Garcia A, Reaume D, Smith RL. Fictitious play for finding system optimal routings in dynamic traffic networks. Transp Res Part B: Methodol. 2000;34(2):147\u201356.","journal-title":"Transp Res Part B: Methodol"},{"key":"1551_CR17","unstructured":"Lambert TJ, Wang H. Fictitious play approach to a mobile unit situation awareness problem. Univ. Michigan, Tech. Rep 2003."},{"issue":"3","key":"1551_CR18","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1287\/opre.1070.0435","volume":"56","author":"E Campos-Na\u00f1ez","year":"2008","unstructured":"Campos-Na\u00f1ez E, Garcia A, Li C. A game-theoretic approach to efficient power management in sensor networks. Oper Res. 2008;56(3):552\u201361.","journal-title":"Oper Res"},{"issue":"4","key":"1551_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.3233\/WIA-140304","volume":"12","author":"C Chen","year":"2014","unstructured":"Chen C, Cheng S-F, Lau HC. Multi-agent orienteering problem with time-dependent capacity constraints. Web Intell Agent Syst. 2014;12(4):347\u201358.","journal-title":"Web Intell Agent Syst"},{"key":"1551_CR20","doi-asserted-by":"crossref","unstructured":"Jonsson A, Rovatsos M. Scaling up multiagent planning: a best-response approach. In: Twenty-First International Conference on Automated Planning and Scheduling 2011.","DOI":"10.1609\/icaps.v21i1.13461"},{"key":"1551_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0Nijs F, Spaan MT, de Weerdt MM. Best-response planning of thermostatically controlled loads under power constraints. In: Twenty-Ninth AAAI Conference on Artificial Intelligence 2015.","DOI":"10.1609\/aaai.v29i1.9234"},{"key":"1551_CR22","doi-asserted-by":"crossref","unstructured":"Nissim R, Brafman RI. Cost-optimal planning by self-interested agents. In: Twenty-Seventh AAAI Conference on Artificial Intelligence 2013.","DOI":"10.1609\/aaai.v27i1.8640"},{"issue":"1","key":"1551_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS. Potential games. Games Econ Behav. 1996;14(1):124\u201343.","journal-title":"Games Econ Behav"},{"issue":"1","key":"1551_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li Y, Chen H, Prins C. Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur J Oper Res. 2016;252(1):27\u201338.","journal-title":"Eur J Oper Res"},{"key":"1551_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.trb.2020.06.003","volume":"139","author":"Y Wang","year":"2020","unstructured":"Wang Y, Lei L, Zhang D, Lee LH. Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of e-commerce and static o2o parcels. Transp Res Part B: Methodol. 2020;139:38\u201363.","journal-title":"Transp Res Part B: Methodol"},{"issue":"4","key":"1551_CR26","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. 2006;40(4):455\u201372.","journal-title":"Transp Sci"},{"issue":"1","key":"1551_CR27","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.tre.2011.07.001","volume":"48","author":"M Qi","year":"2012","unstructured":"Qi M, Lin W-H, Li N, Miao L. A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows. Transp Res Part E: Logis Transp Rev. 2012;48(1):248\u201357.","journal-title":"Transp Res Part E: Logis Transp Rev"},{"key":"1551_CR28","volume-title":"A new local search algorithm providing high quality solutions to vehicle routing problems","author":"P Shaw","year":"1997","unstructured":"Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. Glasgow: APES Group: Dept of Computer Science, University of Strathclyde; 1997."},{"key":"1551_CR29","unstructured":"Nazari M, Oroojlooy A, Tak\u00e1\u010d M, Snyder LV. Reinforcement learning for solving the vehicle routing problem. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, 2018;9861\u20139871."},{"issue":"5","key":"1551_CR30","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TITS.2015.2506900","volume":"17","author":"MM de Weerdt","year":"2015","unstructured":"de Weerdt MM, Stein S, Gerding EH, Robu V, Jennings NR. Intention-aware routing of electric vehicles. IEEE Trans Intell Transp Syst. 2015;17(5):1472\u201382.","journal-title":"IEEE Trans Intell Transp Syst"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01551-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01551-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01551-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T13:10:36Z","timestamp":1673442636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01551-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,11]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["1551"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01551-w","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,11]]},"assertion":[{"value":"1 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research is funded by the National Research Foundation Singapore under its Corp Lab @ University scheme and Fujitsu Limited as part of the A*STAR-Fujitsu-SMU Urban Computing and Engineering Centre of Excellence.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"157"}}