{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:05:18Z","timestamp":1769270718059,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T00:00:00Z","timestamp":1601078400000},"content-version":"vor","delay-in-days":483,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CMMI-1435625"],"award-info":[{"award-number":["CMMI-1435625"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13676-017-0114-7","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T09:57:01Z","timestamp":1516269421000},"page":"119-145","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"title":["Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem"],"prefix":"10.1016","volume":"8","author":[{"given":"Juliette","family":"Medina","sequence":"first","affiliation":[]},{"given":"Mike","family":"Hewitt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6298-0986","authenticated-orcid":false,"given":"Fabien","family":"Lehu\u00e9d\u00e9","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"P\u00e9ton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13676-017-0114-7_bib1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10100-016-0441-z","article-title":"Synchronizing vans and cargo bikes in a city distribution network","volume":"25","author":"Anderluh","year":"2017","journal-title":"Cent Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13676-017-0114-7_bib2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.trc.2008.10.005","article-title":"Service network design with asset management: formulations and comparative analyses","volume":"17","author":"Andersen","year":"2009","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"2","key":"10.1007\/s13676-017-0114-7_bib3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2007.10.057","article-title":"Service network design with management and coordination of multiple fleets","volume":"193","author":"Andersen","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-017-0114-7_bib4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"Top"},{"key":"10.1007\/s13676-017-0114-7_bib5","doi-asserted-by":"crossref","DOI":"10.1287\/opre.2017.1624","article-title":"The continuous-time service network design problem","author":"Boland","year":"2017","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib6","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2009.01.022","article-title":"The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method","volume":"200","author":"Cort\u00e9s","year":"2010","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13676-017-0114-7_bib7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","article-title":"Service network design in freight transportation","volume":"122","author":"Crainic","year":"2000","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13676-017-0114-7_bib8","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/trsc.1090.0279","article-title":"Models for evaluating and planning city logistics systems","volume":"43","author":"Crainic","year":"2009","journal-title":"Transp Sci"},{"issue":"4","key":"10.1007\/s13676-017-0114-7_bib9","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1287\/trsc.2014.0525","article-title":"Service network design with resource constraints","volume":"50","author":"Crainic","year":"2016","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-017-0114-7_bib10","unstructured":"Dellaert N, Saridarq FD, Van Woensel T, Crainic TG (2016) Branch and price based algorithms for the two-echelon vehicle routing problem with time windows. Les cahiers du CIRRELT (CIRRELT-2016-45)"},{"key":"10.1007\/s13676-017-0114-7_bib11","series-title":"Column generation","author":"Desaulniers","year":"2006"},{"issue":"44","key":"10.1007\/s13676-017-0114-7_bib12","doi-asserted-by":"crossref","first-page":"17226","DOI":"10.1021\/ie500209e","article-title":"A branch-and-price approach to manage cargo consolidation and distribution in supply chains","volume":"53","author":"Dondo","year":"2014","journal-title":"Ind Eng Chem Res"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing\u2014a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib14","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/trsc.1120.0441","article-title":"Improved load plan design through integer programming based local search","volume":"47","author":"Erera","year":"2013","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib15","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.cor.2011.10.001","article-title":"Creating schedules and computing operating costs for LTL load plans","volume":"40","author":"Erera","year":"2013","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13676-017-0114-7_bib16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","article-title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","volume":"254","author":"Grangier","year":"2016","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-017-0114-7_bib17","doi-asserted-by":"crossref","unstructured":"Grangier P, Gendreau M, Lehu\u00e9d\u00e9 F, Rousseau LM (2016b) A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Les cahiers du CIRRELT CIRRELT-2016-09","DOI":"10.1016\/j.cor.2017.03.004"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib18","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/trsc.2015.0631","article-title":"Intermediate facilities in freight transportation planning: a survey","volume":"50","author":"Guastaroba","year":"2016","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib19","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.1080.0587","article-title":"Large-scale, less-than-truckload service network design","volume":"57","author":"Jarrah","year":"2009","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0114-7_bib20","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1287\/trsc.1120.0432","article-title":"An adaptive large neighborhood search for the pickup and delivery problem with transfers","volume":"47","author":"Masson","year":"2013","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.orl.2013.01.007","article-title":"Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers","volume":"41","author":"Masson","year":"2013","journal-title":"Oper Res Lett"},{"issue":"3","key":"10.1007\/s13676-017-0114-7_bib22","first-page":"217","article-title":"The pickup and delivery problem with time windows and transshipment","volume":"44","author":"Mitrovi\u0107-Mini\u0107","year":"2006","journal-title":"INFOR"},{"issue":"16","key":"10.1007\/s13676-017-0114-7_bib23","doi-asserted-by":"crossref","first-page":"7495","DOI":"10.1016\/j.eswa.2014.06.010","article-title":"Iterated local search heuristics for the vehicle routing problem with cross-docking","volume":"41","author":"Morais","year":"2014","journal-title":"Expert Syst Appl"},{"issue":"1","key":"10.1007\/s13676-017-0114-7_bib24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"10.1007\/s13676-017-0114-7_bib25","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/trsc.1080.0234","article-title":"Models and tabu search metaheuristics for service network design with asset-balance requirements","volume":"43","author":"Pedersen","year":"2009","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-017-0114-7_bib26","series-title":"Proceedings of the second international conference on computational logistics","first-page":"101","article-title":"The pickup and delivery problem with cross-docking opportunity","author":"Petersen","year":"2011"},{"issue":"10","key":"10.1007\/s13676-017-0114-7_bib27","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/j.cor.2011.11.016","article-title":"A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment","volume":"39","author":"Qu","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13676-017-0114-7_bib28","series-title":"Network optimization","first-page":"412","article-title":"A novel column generation algorithm for the vehicle routing problem with cross-docking","author":"Santos","year":"2011"},{"issue":"4","key":"10.1007\/s13676-017-0114-7_bib29","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1016\/j.cor.2012.11.021","article-title":"The pickup and delivery problem with cross-docking","volume":"40","author":"Santos","year":"2013","journal-title":"Comput Oper Res"},{"issue":"7","key":"10.1007\/s13676-017-0114-7_bib30","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1007\/s11590-012-0558-5","article-title":"Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking","volume":"7","author":"Tarantilis","year":"2013","journal-title":"Optim Lett"},{"key":"10.1007\/s13676-017-0114-7_bib31","series-title":"Vehicle routing: problems, methods, and applications","author":"Toth","year":"2014"},{"issue":"12","key":"10.1007\/s13676-017-0114-7_bib32","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1057\/jors.2008.108","article-title":"Vehicle routing with cross-docking","volume":"60","author":"Wen","year":"2008","journal-title":"J Oper Res Soc"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-017-0114-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0114-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0114-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:41:44Z","timestamp":1761882104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S2192437620300297"],"URL":"https:\/\/doi.org\/10.1007\/s13676-017-0114-7","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-017-0114-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 \u00a9 2018 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}