{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:21:03Z","timestamp":1776331263614,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T00:00:00Z","timestamp":1354752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00291-012-0310-7","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T21:01:18Z","timestamp":1354741278000},"page":"297-322","source":"Crossref","is-referenced-by-count":56,"title":["Synchronized routing of active and passive means of transport"],"prefix":"10.1007","volume":"36","author":[{"given":"Frank","family":"Meisel","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Kopfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,6]]},"reference":[{"issue":"7","key":"310_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/08839510050119253","volume":"14","author":"HJ B\u00fcrckert","year":"2000","unstructured":"B\u00fcrckert HJ, Fischer K, Vierke G (2000) Holonic transport scheduling with teletruck. Appl Artif Intel 14(7):697\u2013725","journal-title":"Appl Artif Intel"},{"key":"310_CR2","doi-asserted-by":"crossref","unstructured":"Bredstr\u00f6m D, R\u00f6nnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19\u201331","DOI":"10.1016\/j.ejor.2007.07.033"},{"issue":"2","key":"310_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tre.2007.07.009","volume":"44","author":"RK Cheung","year":"2008","unstructured":"Cheung RK, Shi N, Powell WB, Simao HP (2008) An attribute-decision model for cross-border drayage problem. Transp Res Part E 44(2):217\u2013234","journal-title":"Transp Res Part E"},{"key":"310_CR4","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s C, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur J Oper Res 200(3):711\u2013724","DOI":"10.1016\/j.ejor.2009.01.022"},{"issue":"1","key":"310_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.ejor.2011.03.032","volume":"213","author":"U Derigs","year":"2011","unstructured":"Derigs U, Kurowsky R, Vogel U (2011) Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services. Eur J Oper Res 213(1):309\u2013319","journal-title":"Eur J Oper Res"},{"issue":"1","key":"310_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179\u2013192","journal-title":"Oper Res"},{"key":"310_CR7","unstructured":"Drexl M (2007) On some generalized routing problems. PhD thesis, RWTH Aachen University"},{"issue":"3","key":"310_CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl M (2012) Synchronization in vehicle routing\u2014a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297\u2013316","journal-title":"Transp Sci"},{"key":"310_CR9","unstructured":"Drexl M, Rieck J, Sigl T, Berning B (2011) Simultaneous vehicle and crew routing and scheduling for partial and full load long-distance road transport. Technical report no 1112, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, Germany"},{"key":"310_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-0-387-77778-8_19","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"C Hempsch","year":"2008","unstructured":"Hempsch C, Irnich S (2008) Vehicle routing problems with inter-tour resource constraints. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 421\u2013444"},{"issue":"1","key":"310_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ejor.2005.01.005","volume":"173","author":"B Hollis","year":"2006","unstructured":"Hollis B, Forbes M, Douglas B (2006) Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post. Eur J Oper Res 173(1):133\u2013150","journal-title":"Eur J Oper Res"},{"key":"310_CR12","doi-asserted-by":"crossref","unstructured":"Kergosien Y, Lent\u00e9 C, Piton D, Billaut JC (2011) A tabu search heuristic for the dynamic transportation of patients between care units. Eur J Oper Res 214(2):442\u2013452","DOI":"10.1016\/j.ejor.2011.04.033"},{"issue":"12","key":"310_CR13","doi-asserted-by":"crossref","first-page":"8424","DOI":"10.1016\/j.eswa.2010.05.036","volume":"37","author":"BI Kim","year":"2010","unstructured":"Kim BI, Koo J, Park J (2010) The combined manpower-vehicle routing problem for multi-staged services. Expert Syst Appl 37(12):8424\u20138431","journal-title":"Expert Syst Appl"},{"issue":"3","key":"310_CR14","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.cie.2007.05.011","volume":"53","author":"B Laurent","year":"2007","unstructured":"Laurent B, Hao J (2007) Simultaneous vehicle and driver scheduling: a case study in a limousine rental company. Comput Ind Eng 53(3):542\u2013558","journal-title":"Comput Ind Eng"},{"issue":"11","key":"310_CR15","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1016\/j.cor.2011.01.021","volume":"38","author":"CKY Lin","year":"2011","unstructured":"Lin CKY (2011) A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Comput Oper Res 38(11):1596\u20131609","journal-title":"Comput Oper Res"},{"issue":"3","key":"310_CR16","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","volume":"45","author":"G Perboli","year":"2011","unstructured":"Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transp Sci 45(3):364\u2013380","journal-title":"Transp Sci"},{"issue":"4","key":"310_CR17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1002\/net.20332","volume":"54","author":"E Prescott-Gagnon","year":"2009","unstructured":"Prescott-Gagnon E, Desaulniers G, Rousseau L (2009) A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4):190\u2013204","journal-title":"Networks"},{"issue":"4","key":"310_CR18","doi-asserted-by":"crossref","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(4):455\u2013472","journal-title":"Transp Sci"},{"key":"310_CR19","unstructured":"Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Department of Computer Science, University of Strathclyde, Scotland, Technical report"},{"issue":"3","key":"310_CR20","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00291-010-0193-4","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. OR Spectr 32(3):787\u2013808","journal-title":"OR Spectr"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-012-0310-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-012-0310-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-012-0310-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:03Z","timestamp":1559041203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-012-0310-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["310"],"URL":"https:\/\/doi.org\/10.1007\/s00291-012-0310-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,6]]}}}