{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T12:10:06Z","timestamp":1779883806972,"version":"3.53.1"},"reference-count":40,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T00:00:00Z","timestamp":1750032000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>ABSTRACT<\/jats:title><jats:p>The Vehicle Routing Problem with Synchronization (VRPSync) aims to minimise the total routing costs while considering synchronization requirements that must be fulfilled between tasks of different routes. These synchronization requirements are especially relevant when it is necessary to have tasks being performed by vehicles within given temporal offsets, a frequent requirement in applications where multiple vehicles, crews, materials, or other resources are involved in certain operations. Although several works in the literature have addressed this problem, mainly the deterministic version has been tackled so far. This paper presents a robust optimization approach for the VRPSync, taking into consideration the uncertainty in vehicle travel times between customers. This work builds on existing approaches in the literature to develop mathematical models for the Robust VRPSync, as well as a branch\u2010and\u2010cut algorithm to solve more difficult problem instances. A set of computational experiments is also devised and presented to obtain insights regarding key performance parameters of the mathematical models and the solution algorithm. The results suggest that solution strategies where certain standard problem constraints are only introduced if a candidate solution violates any of those constraints provide more consistent improvements than approaches that rely on tailor\u2010made cutting planes, added through separation routines. Furthermore, the analysis of the Price of Robustness indicators shows that the adoption of robust solutions can have a significant increase in the total costs, however, this increase quickly plateaus as budgets of uncertainty increase.<\/jats:p>","DOI":"10.1002\/net.22287","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T07:08:14Z","timestamp":1750057694000},"page":"296-324","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Robust Vehicle Routing Problem With Synchronization: Models and Branch\u2010And\u2010Cut Algorithms"],"prefix":"10.1002","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3742-7978","authenticated-orcid":false,"given":"Ricardo","family":"Soares","sequence":"first","affiliation":[{"name":"INESC TEC\u00a0\u2013\u00a0Institute for Systems and Computer Engineering, Technology and Science  Porto Portugal"},{"name":"FEUP\u00a0\u2013\u00a0Faculty of Engineering, University of Porto  Porto Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7428-9770","authenticated-orcid":false,"given":"Sophie N.","family":"Parragh","sequence":"additional","affiliation":[{"name":"Institute of Production and Logistics Management\/JKU Business School Johannes Kepler University Linz  Linz Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-8723","authenticated-orcid":false,"given":"Alexandra","family":"Marques","sequence":"additional","affiliation":[{"name":"INESC TEC\u00a0\u2013\u00a0Institute for Systems and Computer Engineering, Technology and Science  Porto Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7857-3405","authenticated-orcid":false,"given":"Pedro","family":"Amorim","sequence":"additional","affiliation":[{"name":"INESC TEC\u00a0\u2013\u00a0Institute for Systems and Computer Engineering, Technology and Science  Porto Portugal"},{"name":"FEUP\u00a0\u2013\u00a0Faculty of Engineering, University of Porto  Porto Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2025,6,16]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.033"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10729\u2010013\u20109243\u20101"},{"key":"e_1_2_9_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.05.021"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105085"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2020.05.010"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.22019"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/s0305\u20100548(00)00056\u20103"},{"key":"e_1_2_9_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291\u2010012\u20100310\u20107"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/pl00011424"},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4_3"},{"key":"e_1_2_9_12_1","first-page":"153","volume-title":"Risk and Optimization in an Uncertain World","author":"Ord\u00f3\u00f1ez F.","year":"2010"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0400"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.04.007"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1111"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orhc.2018.03.008"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0956"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.124112"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10696\u2010019\u201009351\u2010w"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1746850"},{"key":"e_1_2_9_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100\u2010018\u20100520\u20104"},{"key":"e_1_2_9_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1154"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170701745378"},{"key":"e_1_2_9_25_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2011.136"},{"key":"e_1_2_9_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.006"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2020.1013"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0886"},{"key":"e_1_2_9_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32147-4_23"},{"key":"e_1_2_9_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.10.002"},{"key":"e_1_2_9_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1136"},{"key":"e_1_2_9_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1160"},{"key":"e_1_2_9_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.12.019"},{"key":"e_1_2_9_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101888"},{"key":"e_1_2_9_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20472"},{"key":"e_1_2_9_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291\u2010024\u201000781\u2010z"},{"key":"e_1_2_9_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097\u20100037(200009)36:2\u00a169::aid\u2010net1\u00bf3.0.co;2\u2010q"},{"key":"e_1_2_9_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291\u2010021\u201000631\u20102"},{"key":"e_1_2_9_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107\u2010003\u20100481\u20108"},{"key":"e_1_2_9_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"e_1_2_9_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2014.12.006"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.22287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T03:07:36Z","timestamp":1758510456000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.22287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,16]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10.1002\/net.22287"],"URL":"https:\/\/doi.org\/10.1002\/net.22287","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,16]]},"assertion":[{"value":"2024-04-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}