{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:26:07Z","timestamp":1765887967550,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T00:00:00Z","timestamp":1517961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["T514-N13"],"award-info":[{"award-number":["T514-N13"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10100-018-0520-4","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T06:14:51Z","timestamp":1517984091000},"page":"443-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Solving routing problems with pairwise synchronization constraints"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7428-9770","authenticated-orcid":false,"given":"Sophie N.","family":"Parragh","sequence":"first","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"issue":"3","key":"520_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 (2016) Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optim Lett 10(3):511\u2013525","journal-title":"Optim Lett"},{"issue":"4","key":"520_CR2","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.cie.2011.07.001","volume":"61","author":"H Andersson","year":"2011","unstructured":"Andersson H, Duesund JM, Fagerholt K (2011) Ship routing and scheduling with cargo coupling and synchronization constraints. Comput Ind Eng 61(4):1107\u20131116","journal-title":"Comput Ind Eng"},{"key":"520_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.36.1.1.571","volume":"36","author":"A Armacost","year":"2002","unstructured":"Armacost A, Barnhart C, Ware KA (2002) Composite variable formulations for express shipment service network design. Transp Sci 36:1\u201320","journal-title":"Transp Sci"},{"key":"520_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/inte.1030.0060","volume":"43","author":"A Armacost","year":"2004","unstructured":"Armacost A, Barnhart C, Ware KA, Wilson AM (2004) UPS optimizes its air network. Interfaces 43:15\u201325","journal-title":"Interfaces"},{"issue":"2","key":"520_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1002\/net.21589","volume":"65","author":"M B\u00f6gl","year":"2015","unstructured":"B\u00f6gl M, Doerner KF, Parragh SN (2015) The school bus routing and scheduling problem with transfers. Networks 65(2):180\u2013203","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Bredstr\u00f6m D, R\u00f6nnqvist M (2007) A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. Technical report, Department of Finance and Management Science, Norwegian School of Economics and Business Administration","key":"520_CR6","DOI":"10.2139\/ssrn.971726"},{"key":"520_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m D, R\u00f6nnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191:19\u201329","journal-title":"Eur J Oper Res"},{"key":"520_CR8","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn A, Koling E, Clausen J (2009) The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput Oper Res 36:1145\u20131157","journal-title":"Comput Oper Res"},{"issue":"4","key":"520_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.20472","volume":"58","author":"A Dohn","year":"2011","unstructured":"Dohn A, Rasmussen MS, Larsen J (2011) The vehicle routing problem with time windows and temporal dependencies. Networks 58(4):273\u2013289","journal-title":"Networks"},{"issue":"3","key":"520_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl M (2012) Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297\u2013316","journal-title":"Transp Sci"},{"issue":"3","key":"520_CR11","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.cor.2011.02.002","volume":"40","author":"N Hachemi El","year":"2013","unstructured":"El Hachemi N, Gendreau M, Rousseau L-M (2013) A heuristic to solve the synchronized log-truck scheduling problem. Comput Oper Res 40(3):666\u2013673","journal-title":"Comput Oper Res"},{"key":"520_CR12","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.ejor.2005.01.011","volume":"171","author":"P Eveborn","year":"2006","unstructured":"Eveborn P, Flisberg P, R\u00f6nnqvist M (2006) Laps Care\u2014an operational system for staff planning of home care. Eur J Oper Res 171:962\u2013976","journal-title":"Eur J Oper Res"},{"key":"520_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/inte.1080.0411","volume":"39","author":"P Eveborn","year":"2009","unstructured":"Eveborn P, R\u00f6nnqvist M, Einarsdottir H, Eklund M, Liden K, Almroth M (2009) Operations research improves quality and efficiency in home care. Interfaces 39:18\u201334","journal-title":"Interfaces"},{"key":"520_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-011-9188-9","volume":"19","author":"V Hemmelmayr","year":"2013","unstructured":"Hemmelmayr V, Doerner KF, Hartl RF, Rath S (2013) A heuristic solution method for node routing based solid waste collection problems. J Heuristics 19:1\u201328","journal-title":"J Heuristics"},{"key":"520_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","volume":"119","author":"I Ioachim","year":"1999","unstructured":"Ioachim I, Desrosiers J, Soumis F, B\u00e9langer N (1999) Fleet assignment and crew scheduling with synchronization constraints. Eur J Oper Res 119:75\u201390","journal-title":"Eur J Oper Res"},{"key":"520_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"520_CR17","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs AA, Parragh SN, Doerner KF, Hartl R (2012) Adaptive large neighborhood search for service technician routing and scheduling problems. J Sched 15:579\u2013600","journal-title":"J Sched"},{"key":"520_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1002\/nav.20075","volume":"52","author":"Y Li","year":"2005","unstructured":"Li Y, Lim A, Rodrigues B (2005) Manpower allocation with time windows and job-teaming constraints. Nav Res Logist 52:302\u2013311","journal-title":"Nav Res Logist"},{"issue":"1","key":"520_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska DS, Meisel F, Bierwirth C (2014) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17(1):15\u201330","journal-title":"Health Care Manag Sci"},{"key":"520_CR20","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, Lehuede F, Peton O (2014) The dial-a-ride problem with transfers. Comput Oper Res 41:12\u201323","journal-title":"Comput Oper Res"},{"key":"520_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/trsc.1070.0195","volume":"42","author":"N Perrier","year":"2008","unstructured":"Perrier N, Langevin A, Amaya C-A (2008) Vehicle routing for urban snow plowing operations. Transp Sci 42:44\u201356","journal-title":"Transp Sci"},{"key":"520_CR22","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2011","unstructured":"Prins C (2011) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985\u20132002","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"520_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s13676-013-0023-3","volume":"2","author":"N-H Quttineh","year":"2013","unstructured":"Quttineh N-H, Larsson T, Lundberg K, Holmberg K (2013) Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence. EURO J Transp Logist 2(1\u20132):109\u2013127","journal-title":"EURO J Transp Logist"},{"issue":"1","key":"520_CR24","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2012.09.008","volume":"225","author":"LB Reinhardt","year":"2013","unstructured":"Reinhardt LB, Clausen T, Pisinger D (2013) Synchronized dial-a-ride transportation of disabled passengers at airports. Eur J Oper Res 225(1):106\u2013117","journal-title":"Eur J Oper Res"},{"key":"520_CR25","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. Transp Sci 40:455\u2013472","journal-title":"Transp Sci"},{"issue":"2","key":"520_CR26","first-page":"76","volume":"51","author":"L-M Rousseau","year":"2013","unstructured":"Rousseau L-M, Gendreau M, Pesant G (2013) The synchronized dynamic vehicle dispatching problem. INFOR Inf Syst Oper Res 51(2):76\u201383","journal-title":"INFOR Inf Syst Oper Res"},{"key":"520_CR27","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1016\/j.cor.2011.08.014","volume":"39","author":"A Salazar-Aguilar","year":"2012","unstructured":"Salazar-Aguilar A, Langevin A, Laporte G (2012) Synchronized arc routing for snow plowing operations. Comput Oper Res 39:1432\u20131440","journal-title":"Comput Oper Res"},{"key":"520_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4:146\u2013154","journal-title":"ORSA J Comput"},{"key":"520_CR29","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/trsc.1080.0249","volume":"43","author":"V Schmid","year":"2009","unstructured":"Schmid V, Doerner KF, Hartl Savelsbergh MWP, St\u00f6cher W (2009) A hybrid solution approach for ready mixed concrete delivery. Transp Sci 43:70\u201385","journal-title":"Transp Sci"},{"key":"520_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.cor.2008.07.010","volume":"37","author":"V Schmid","year":"2010","unstructured":"Schmid V, Doerner KF, Hartl RF, Salazar-Gonzalez JJ (2010) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput Oper Res 37:559\u2013574","journal-title":"Comput Oper Res"},{"key":"520_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s12469-016-0139-6","volume":"9","author":"J Sch\u00f6nberger","year":"2017","unstructured":"Sch\u00f6nberger J (2017) Scheduling constraints in dial-a-ride problems with transfers: a metaheuristic approach incorporating a cross-route scheduling procedure with postponement opportunities. Public Transp 9:243\u2013272","journal-title":"Public Transp"},{"key":"520_CR32","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254\u2013265","journal-title":"Oper Res"},{"key":"520_CR33","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s13676-014-0061-5","volume":"4","author":"M St\u00e5lhane","year":"2015","unstructured":"St\u00e5lhane M, Andersson H, Christiansen M (2015) A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints. EURO J Transp Logist 4:421\u2013443","journal-title":"EURO J Transp Logist"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0520-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0520-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0520-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T08:04:10Z","timestamp":1570694650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0520-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,7]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0520-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,2,7]]},"assertion":[{"value":"7 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}