{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:54:57Z","timestamp":1770681297207,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s11590-023-02037-1","type":"journal-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T13:01:45Z","timestamp":1688734905000},"page":"1711-1738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The rendezvous vehicle routing problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Bruce","family":"Golden","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2489-7241","authenticated-orcid":false,"given":"Eric","family":"Oden","sequence":"additional","affiliation":[]},{"given":"S.","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"2037_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s11590-015-0878-3","volume":"10","author":"S Afifi","year":"2016","unstructured":"Afifi, S., Dang, D.-C., Moukrim, A.: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Opt. Lett. 10, 511\u2013525 (2016)","journal-title":"Opt. Lett."},{"key":"2037_CR2","volume-title":"Network Flows - Theory, Algorithms and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows - Theory, Algorithms and Applications. Prentice Hall, New Jersey (1993)"},{"issue":"4","key":"2037_CR3","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/s10696-019-09351-w","volume":"32","author":"A Anderluh","year":"2020","unstructured":"Anderluh, A., Larsen, R., Hemmelmayr, V.C., Nolz, P.C.: Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization. Flex. Serv. Manuf. J. 32(4), 806\u2013828 (2020)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"2037_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"issue":"1","key":"2037_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-020-00607-8","volume":"43","author":"N Boysen","year":"2020","unstructured":"Boysen, N., Fedtke, S., Schwerdfeger, S.: Last-mile delivery concepts: a survey from an operational research perspective. OR Spectr. 43(1), 1\u201358 (2020)","journal-title":"OR Spectr."},{"key":"2037_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10100-019-00625-0","volume":"29","author":"C Brandst\u00e4tter","year":"2021","unstructured":"Brandst\u00e4tter, C.: A metaheuristic algorithm and structured analysis for the line-haul feeder vehicle routing problem with time windows. CEJOR 29, 247\u2013289 (2021)","journal-title":"CEJOR"},{"issue":"1","key":"2037_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.ejor.2018.03.014","volume":"270","author":"C Brandst\u00e4tter","year":"2018","unstructured":"Brandst\u00e4tter, C., Reimann, M.: The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches. Eur. J. Oper. Res. 270(1), 157\u2013170 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"2037_CR8","unstructured":"Census, U.: Quarterly Retail e-commerce Sales 3rd Quarter 2020 (2020). https:\/\/www.census.gov\/retail\/mrts\/www\/data\/pdf\/ec_current.pdf?"},{"issue":"1","key":"2037_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/trsc.2019.0944","volume":"54","author":"I Dayarian","year":"2020","unstructured":"Dayarian, I., Savelsbergh, M., Clarke, J.-P.: Same-day delivery with drone resupply. Transp. Sci. 54(1), 229\u2013249 (2020)","journal-title":"Transp. Sci."},{"key":"2037_CR10","doi-asserted-by":"publisher","first-page":"105154","DOI":"10.1016\/j.cor.2020.105154","volume":"127","author":"N Dellaert","year":"2021","unstructured":"Dellaert, N., Woensel, T.V., Crainic, T.G., Saridarq, F.D.: A multi-commodity two-echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach. Comput. Oper. Res. 127, 105154 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2037_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342\u2013354 (1992). https:\/\/doi.org\/10.1287\/opre.40.2.342","journal-title":"Oper. Res."},{"issue":"3","key":"2037_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints. Transp. Sci. 46(3), 297\u2013316 (2012)","journal-title":"Transp. Sci."},{"issue":"3","key":"2037_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216\u2013229 (2004). https:\/\/doi.org\/10.1002\/net.20033","journal-title":"Networks"},{"key":"2037_CR14","unstructured":"Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99-Short Course on Evolutionary Algorithms in Engineering and Computer Science, pp. 57\u201364 (1999)"},{"issue":"1","key":"2037_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","volume":"254","author":"P Grangier","year":"2016","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.-M.: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res. 254(1), 80\u201391 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"2037_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.cor.2017.03.004","volume":"84","author":"P Grangier","year":"2017","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.-M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116\u2013126 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"2037_CR17","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: The consistent vehicle routing problem. Manuf. Serv. Oper. Manag. 11(4), 630\u2013643 (2009)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"1","key":"2037_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"2037_CR19","unstructured":"Jacobs, K., Warner, S., Rietra, M., Mazza, L., Buvat, J., Khadikar, A., Cherian, S., Khemka, Y.: The last-mile delivery challenge. Tech. rep. (2019). https:\/\/www.capgemini.com\/wp-content\/uploads\/2019\/01\/Report-Digital-%E2%80%93-Last-Mile-Delivery-Challenge1.pdf"},{"issue":"3","key":"2037_CR20","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2020.06.019","volume":"288","author":"H Li","year":"2021","unstructured":"Li, H., Wang, H., Chen, J., Bai, M.: Two-echelon vehicle routing problem with satellite bi-synchronization. Eur. J. Oper. Res. 288(3), 775\u2013793 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2037_CR21","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1287\/trsc.2022.1136","volume":"56","author":"G Marques","year":"2022","unstructured":"Marques, G., Sadykov, R., Dupas, R., Deschamps, J.-C.: A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. Transp. Sci. 56(6), 1598\u20131617 (2022)","journal-title":"Transp. Sci."},{"issue":"2","key":"2037_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/net.22087","volume":"80","author":"A Masone","year":"2022","unstructured":"Masone, A., Poikonen, S., Golden, B.: The multivisit drone routing problem with edge launches: an iterative approach with discrete and continuous improvements. Networks 80(2), 193\u2013215 (2022)","journal-title":"Networks"},{"issue":"3","key":"2037_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.orl.2013.01.007","volume":"41","author":"R Masson","year":"2013","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O.: Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper. Res. Lett. 41(3), 211\u2013215 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2037_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.07.020","volume":"41","author":"R Masson","year":"2014","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O.: The dial-a-ride problem with transfers. Comput. Oper. Res. 41(1), 12\u201323 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2037_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s13676-017-0114-7","volume":"8","author":"J Medina","year":"2019","unstructured":"Medina, J., Hewitt, M., Lehu\u00e9d\u00e9, F., P\u00e9ton, O.: Integrating long-haul and local transportation planning: the service network design and routing problem. EURO J. Transp. Logist. 8(2), 119\u2013145 (2019)","journal-title":"EURO J. Transp. Logist."},{"issue":"1","key":"2037_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1080\/01605682.2019.1650625","volume":"72","author":"SM Mirhedayatian","year":"2021","unstructured":"Mirhedayatian, S.M., Crainic, T.G., Guajardo, M., Wallace, S.W.: A two-echelon location-routing problem with synchronisation. J. Oper. Res. Soc. 72(1), 145\u2013160 (2021)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"2037_CR27","doi-asserted-by":"publisher","first-page":"100015","DOI":"10.1016\/j.ejtl.2020.100015","volume":"9","author":"PC Nolz","year":"2020","unstructured":"Nolz, P.C., Absi, N., Cattaruzza, D., Feillet, D.: Two-echelon distribution with a single capacitated city hub. EURO J. Transp. Logist. 9(3), 100015 (2020)","journal-title":"EURO J. Transp. Logist."},{"key":"2037_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cor.2017.01.020","volume":"83","author":"SN Parragh","year":"2017","unstructured":"Parragh, S.N., Cordeau, J.-F.: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83, 28\u201344 (2017)","journal-title":"Comput. Oper. Res."},{"key":"2037_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.engappai.2019.06.006","volume":"85","author":"Z Peng","year":"2019","unstructured":"Peng, Z., Chami, Z.A., Manier, H., Manier, M.-A.: A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers. Eng. Appl. Artif. Intell. 85, 99\u2013111 (2019)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"10","key":"2037_CR30","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1016\/j.cor.2011.11.016","volume":"39","author":"Y Qu","year":"2012","unstructured":"Qu, Y., Bard, J.: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39(10), 2439\u20132456 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2037_CR31","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2013.10.038","volume":"235","author":"A Rais","year":"2014","unstructured":"Rais, A., Alvelos, F., Carvalho, M.: New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur. J. Oper. Res. 235(3), 530\u2013539 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"2037_CR32","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1016\/j.cor.2011.08.014","volume":"39","author":"MA Salazar-Aguilar","year":"2012","unstructured":"Salazar-Aguilar, M.A., Langevin, A., Laporte, G.: Synchronized arc routing for snow plowing operations. Comput. Oper. Res. 39(7), 1432\u20131440 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"2037_CR33","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cor.2013.01.007","volume":"40","author":"MA Salazar-Aguilar","year":"2013","unstructured":"Salazar-Aguilar, M.A., Langevin, A., Laporte, G.: The synchronized arc and node routing problem: Application to road marking. Comput. Oper. Res. 40(7), 1708\u20131715 (2013)","journal-title":"Comput. Oper. Res."},{"key":"2037_CR34","unstructured":"Soares, R.: New Models and Methods for the Vehicle Routing Problem with Multiple Synchronisation Constraints. Ph.D. dissertation, Universidade do Porto, Portugal (2022)"},{"key":"2037_CR35","unstructured":"Soares, R., Marques, A., Amorim, P., Parragh, S.: Synchronisation in Vehicle Routing: A Literature-based Classification Schema and Modelling Framework. Technical report, Universidade do Porto, Portugal (2021)"},{"issue":"2","key":"2037_CR36","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"2037_CR37","doi-asserted-by":"publisher","first-page":"9302","DOI":"10.1016\/j.apm.2016.06.013","volume":"40","author":"P-Y Yin","year":"2016","unstructured":"Yin, P.-Y., Chuang, Y.-L.: Adaptive memory artificial bee colony algorithm for green vehicle routing with cross-docking. Appl. Math. Model. 40, 9302\u20139315 (2016)","journal-title":"Appl. Math. Model."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02037-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02037-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02037-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:21:28Z","timestamp":1695198088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02037-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":37,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["2037"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02037-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"30 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}