{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:41:01Z","timestamp":1775130061986,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["14894"],"award-info":[{"award-number":["14894"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Carriers can remarkably reduce transportation costs and emissions when they collaborate, for example through a platform. Such gains, however, have only been investigated for relatively small problem instances with low numbers of carriers. We develop auction-based methods for large-scale dynamic collaborative pickup and delivery problems, combining techniques of multi-agent systems and combinatorial auctions. We evaluate our approach in terms of both solution quality and possibilities of strategic behaviour using a real-world data set of over 12,000 orders. Hence, this study is (to the best of our knowledge) the first to assess the benefits of large-scale carrier cooperation and to propose an approach for it. First, we use iterative single-order auctions to investigate possible collaboration gains for increasing numbers of carriers. Our results show that travel costs can be reduced by up to 77% when 1000 carriers collaborate, largely increasing the gains that were previously observed in smaller-scale collaboration. We also ensure that individual rationality is guaranteed in each auction. Next, we compare this approach of multiple local auctions with an established central combinatorial auction mechanism and observe that the proposed approach performs better on large-scale instances. Furthermore, to improve solution quality, we integrate the two approaches by allowing small bundle auctions in the multi-agent system. We analyze the circumstances under which bundling is beneficial in a large-scale decentralized system and demonstrate that travel cost gains of up to 13% can be obtained for 1000 carriers. Finally, we investigate whether the system is vulnerable to cheating: we show that misrepresentation of true values by individual participants sometimes can benefit them at the cost of the collective. Although such strategic behaviour is not straightforward, we also discuss different means to prevent it.<\/jats:p>","DOI":"10.1007\/s10479-021-04504-3","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T09:04:23Z","timestamp":1649408663000},"page":"201-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Large-scale collaborative vehicle routing"],"prefix":"10.1007","volume":"350","author":[{"given":"Johan","family":"Los","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margaretha","family":"Gansterer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthijs T. J.","family":"Spaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudy R.","family":"Negenborn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"4504_CR1","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.tre.2009.12.006","volume":"46","author":"S Berger","year":"2010","unstructured":"Berger, S., & Bierwirth, C. (2010). Solutions to the request reassignment problem in collaborative carrier networks. Transportation Research Part E, 46, 627\u2013638.","journal-title":"Transportation Research Part E"},{"key":"4504_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A. M., & Savelsbergh, M. (2004). Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science, 38, 369\u2013378.","journal-title":"Transportation Science"},{"key":"4504_CR3","doi-asserted-by":"crossref","unstructured":"Cruijssen, F. (2020). Cross-chain collaboration in logistics: Looking back and ahead. International Series in Operations Research & Management Science (Vol. 297). Springer.","DOI":"10.1007\/978-3-030-57093-4"},{"key":"4504_CR4","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. (2011). A multi-agent and auction-based framework and approach for carrier collaboration. Logistics Research, 3, 101\u2013120.","journal-title":"Logistics Research"},{"key":"4504_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s12351-014-0141-1","volume":"14","author":"B Dai","year":"2014","unstructured":"Dai, B., Chen, H., & Yang, G. (2014). Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests. Operational Research, 14, 361\u2013386.","journal-title":"Operational Research"},{"key":"4504_CR6","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.ejor.2017.08.051","volume":"265","author":"E Fern\u00e1ndez","year":"2018","unstructured":"Fern\u00e1ndez, E., Roca-Riu, M., & Speranza, M. G. (2018). The shared customer collaboration vehicle routing problem. European Journal of Operational Research, 265, 1078\u20131093.","journal-title":"European Journal of Operational Research"},{"key":"4504_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.3141\/1882-02","volume":"1882","author":"MA Figliozzi","year":"2004","unstructured":"Figliozzi, M. A., Mahmassani, H. S., & Jaillet, P. (2004). Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions. Transportation Research Record, 1882, 10\u201318.","journal-title":"Transportation Research Record"},{"key":"4504_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1177\/0361198105190600111","volume":"1906","author":"MA Figliozzi","year":"2005","unstructured":"Figliozzi, M. A., Mahmassani, H. S., & Jaillet, P. (2005). Impacts of auction settings on the performance of truckload transportation marketplaces. Transportation Research Record, 1906, 89\u201396.","journal-title":"Transportation Research Record"},{"key":"4504_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00291-015-0411-1","volume":"38","author":"M Gansterer","year":"2016","unstructured":"Gansterer, M., & Hartl, R. F. (2016). Request evaluation strategies for carriers in auction-based collaborations. OR Spectrum, 38, 3\u201323.","journal-title":"OR Spectrum"},{"key":"4504_CR10","doi-asserted-by":"crossref","unstructured":"Gansterer, M., & Hartl, R. F. (2018a). Centralized bundle generation in auction-based collaborative transportation. OR Spectrum, 40, 613\u2013635.","DOI":"10.1007\/s00291-018-0516-4"},{"key":"4504_CR11","doi-asserted-by":"crossref","unstructured":"Gansterer, M., & Hartl, R. F. (2018b). Collaborative vehicle routing: A survey. European Journal of Operational Research, 268, 1\u201312.","DOI":"10.1016\/j.ejor.2017.10.023"},{"key":"4504_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-020-00541-6","volume":"28","author":"M Gansterer","year":"2020","unstructured":"Gansterer, M., & Hartl, R. F. (2020). Shared resources in collaborative vehicle routing. TOP, 28, 1\u201320.","journal-title":"TOP"},{"key":"4504_CR13","doi-asserted-by":"crossref","unstructured":"Gansterer, M., Hartl, R. F., & Savelsbergh, M. (2020a). The value of information in auction-based carrier collaborations. International Journal of Production Economics, 221, 107485.","DOI":"10.1016\/j.ijpe.2019.09.006"},{"key":"4504_CR14","doi-asserted-by":"crossref","unstructured":"Gansterer, M., Hartl, R. F., & S\u00f6rensen, K. (2020b). Pushing frontiers in auction-based transport collaborations. Omega, 94, 102042.","DOI":"10.1016\/j.omega.2019.01.011"},{"key":"4504_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo, M., & R\u00f6nnqvist, M. (2016). A review on cost allocation methods in collaborative transportation. International Transactions in Operational Research, 23, 371\u2013392.","journal-title":"International Transactions in Operational Research"},{"key":"4504_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tre.2017.09.006","volume":"107","author":"M Lai","year":"2017","unstructured":"Lai, M., Cai, X., & Hu, Q. (2017). An iterative auction for carrier collaboration in truckload pickup and delivery. Transportation Research Part E, 107, 60\u201380.","journal-title":"Transportation Research Part E"},{"key":"4504_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tre.2015.09.010","volume":"84","author":"J Li","year":"2015","unstructured":"Li, J., Rong, G., & Feng, Y. (2015). Request selection and exchange approach for carrier collaboration based on auction of a single request. Transportation Research Part E, 84, 23\u201339.","journal-title":"Transportation Research Part E"},{"key":"4504_CR18","doi-asserted-by":"crossref","unstructured":"Los, J., Schulte, F., Gansterer, M., Hartl, R. F., Spaan, M. T. J., & Negenborn, R. R. (2020a). Decentralized combinatorial auctions for dynamic and large-scale collaborative vehicle routing. In E. Lalla-Ruiz, M. Mes, & S. Vo\u00df (Eds.), Computational logistics (pp. 215\u2013230). Springer.","DOI":"10.1007\/978-3-030-59747-4_14"},{"key":"4504_CR19","doi-asserted-by":"crossref","unstructured":"Los, J., Schulte, F., Spaan, M. T. J., & Negenborn, R. R. (2020b). The value of information sharing for platform-based collaborative vehicle routing. Transportation Research Part E, 141, 102011.","DOI":"10.1016\/j.tre.2020.102011"},{"key":"4504_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tre.2019.07.004","volume":"129","author":"X Lyu","year":"2019","unstructured":"Lyu, X., Chen, H., Wang, N., & Yang, Z. (2019). A multi-round exchange mechanism for carrier collaboration in less than truckload transportation. Transportation Research Part E, 129, 38\u201359.","journal-title":"Transportation Research Part E"},{"key":"4504_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.trc.2009.04.018","volume":"18","author":"T M\u00e1hr","year":"2010","unstructured":"M\u00e1hr, T., Srour, J., de Weerdt, M., & Zuidwijk, R. (2010). Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty. Transportation Research Part C, 18, 99\u2013119.","journal-title":"Transportation Research Part C"},{"key":"4504_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10100-011-0230-7","volume":"21","author":"M Mes","year":"2013","unstructured":"Mes, M., van der Heijden, M., & Schuur, P. (2013). Interaction between intelligent agent strategies for real-time transportation planning. Central European Journal of Operations Research, 21, 337\u2013358.","journal-title":"Central European Journal of Operations Research"},{"key":"4504_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tre.2017.09.001","volume":"107","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., & Caris, A. (2017). Benefits of horizontal cooperation in dial-a-ride services. Transportation Research Part E, 107, 97\u2013119.","journal-title":"Transportation Research Part E"},{"key":"4504_CR24","doi-asserted-by":"crossref","unstructured":"Montoya-Torres, J. R., Mu\u00f1oz-Villamizar, A., & Vega-Mej\u00eda, C. A. (2016). On the impact of collaborative strategies for goods delivery in city logistics. Production Planning & Control, 27, 443\u2013455.","DOI":"10.1080\/09537287.2016.1147092"},{"key":"4504_CR25","doi-asserted-by":"publisher","first-page":"5340","DOI":"10.1080\/00207543.2019.1574040","volume":"57","author":"S Pan","year":"2019","unstructured":"Pan, S., Trentesaux, D., Ballot, E., & Huang, G. Q. (2019). Horizontal collaborative transport: Survey of solutions and practical implementation issues. International Journal of Production Research, 57, 5340\u20135361.","journal-title":"International Journal of Production Research"},{"key":"4504_CR26","doi-asserted-by":"crossref","unstructured":"Pisinger, D., & Ropke, S. (2019). Large neighborhood search. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics. International Series in Operations Research & Management Science (Vol. 272, pp. 99\u2013127). Springer.","DOI":"10.1007\/978-3-319-91086-4_4"},{"key":"4504_CR27","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. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455\u2013472.","journal-title":"Transportation Science"},{"key":"4504_CR28","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tre.2017.03.008","volume":"105","author":"F Schulte","year":"2017","unstructured":"Schulte, F., Lalla-Ruiz, E., Gonz\u00e1lez-Ram\u00edrez, R. G., & Vo\u00df, S. (2017). Reducing port-related empty truck emissions: a mathematical approach for truck appointments with collaboration. Transportation Research Part E, 105, 195\u2013212.","journal-title":"Transportation Research Part E"},{"key":"4504_CR29","doi-asserted-by":"crossref","unstructured":"Van Heeswijk, W. (2020). Smart containers with bidding capacity: A policy gradient algorithm for semi-cooperative learning. In E. Lalla-Ruiz, M. Mes, & S. Vo\u00df (Eds.), Computational logistics (pp. 52\u201367). Springer.","DOI":"10.1007\/978-3-030-59747-4_4"},{"key":"4504_CR30","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1007\/s10458-017-9371-y","volume":"31","author":"RRS Van Lon","year":"2017","unstructured":"Van Lon, R. R. S., & Holvoet, T. (2017). When do agents outperform centralized algorithms? A systematic empirical evaluation in logistics. Autonomous Agents and Multi-Agent Systems, 31, 1578\u20131609.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"4504_CR31","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1080\/01441647.2013.853706","volume":"33","author":"L Verdonck","year":"2013","unstructured":"Verdonck, L., Caris, A., Ramaekers, K., & Janssens, G. K. (2013). Collaborative logistics from the perspective of road transportation companies. Transport Reviews, 33, 700\u2013719.","journal-title":"Transport Reviews"},{"key":"4504_CR32","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. (2014). Collaborative transportation planning of less-than-truckload freight. OR Spectrum, 36, 357\u2013380.","journal-title":"OR Spectrum"},{"key":"4504_CR33","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10696-015-9212-8","volume":"27","author":"X Wang","year":"2015","unstructured":"Wang, X., & Kopfer, H. (2015). Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests. Flexible Services and Manufacturing Journal, 27, 509\u2013533.","journal-title":"Flexible Services and Manufacturing Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04504-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04504-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04504-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:54:38Z","timestamp":1757094878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04504-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,8]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["4504"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04504-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,8]]},"assertion":[{"value":"15 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}