{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T22:51:12Z","timestamp":1771368672194,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,6,7]],"date-time":"2013-06-07T00:00:00Z","timestamp":1370563200000},"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-013-0331-x","type":"journal-article","created":{"date-parts":[[2013,6,6]],"date-time":"2013-06-06T06:31:44Z","timestamp":1370500304000},"page":"357-380","source":"Crossref","is-referenced-by-count":102,"title":["Collaborative transportation planning of less-than-truckload freight"],"prefix":"10.1007","volume":"36","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Kopfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,7]]},"reference":[{"key":"331_CR1","unstructured":"Bent R, van Hentenryck P (2003) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Lecture notes in computer science 2833\/2003. Principles and practice of constraint programming\u2014CP 2003, pp 123\u2013137"},{"key":"331_CR2","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.tre.2009.12.006","volume":"46","author":"S Berger","year":"2010","unstructured":"Berger S, Bierwirth C (2010) Solutions to the request reassignment in collaborative carrier networks. Transp Res E 46:627\u2013638","journal-title":"Transp Res E"},{"key":"331_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"S Butt","year":"1999","unstructured":"Butt S, Ryan D (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Oper Res 26:427\u2013441","journal-title":"Comput Oper Res"},{"key":"331_CR4","doi-asserted-by":"crossref","unstructured":"Cordeau JF, Desaulniers G, Desrosiers J, Solomon M, Soumis F (2002) VRP with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol 9. SIAM, Philadelphia, pp157\u2013194","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"331_CR5","doi-asserted-by":"crossref","unstructured":"Cruijssen F, Salomon M (2004) Empirical study: order sharing between transportation companies may result in cost reductions between 5 to 15 percent. In: CentER discussion paper no. 2004\u201380","DOI":"10.2139\/ssrn.607062"},{"key":"331_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1108\/09600030710752514","volume":"37","author":"F Cruijssen","year":"2007","unstructured":"Cruijssen F, Br\u00e4ysy O, Dullaert W, Fleuren H, Salomon M (2007a) Joint route planning under varying market conditions. Int J Phys Distrib Logist Manag 37:287\u2013304","journal-title":"Int J Phys Distrib Logist Manag"},{"key":"331_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.tre.2005.09.007","volume":"43","author":"F Cruijssen","year":"2007","unstructured":"Cruijssen F, Cools M, Dullaert W (2007b) Horizontal cooperation in logistics: opportunities and impediments. Transport Res E 43:129\u2013142","journal-title":"Transport Res E"},{"key":"331_CR8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.5325\/transportationj.46.3.0022","volume":"46","author":"F Cruijssen","year":"2007","unstructured":"Cruijssen F, Dullaert W, Fleuren H (2007c) Horizontal cooperation in transport and logistics: a literature review. Transport J 46:22\u201339","journal-title":"Transport J"},{"key":"331_CR9","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Erdmann A, Solomon M, Soumis F (2002) VRP with pickup and delivery. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol 9. SIAM, Philadelphia, pp 225\u2013242","DOI":"10.1137\/1.9780898718515.ch9"},{"key":"331_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7\u201322","journal-title":"Eur J Oper Res"},{"key":"331_CR11","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problem with profits. Transport Sci 39:188\u2013205","journal-title":"Transport Sci"},{"key":"331_CR12","doi-asserted-by":"crossref","unstructured":"Kopfer H, Pankratz G (1999) Das groupage-problem kooperierender Verkehrstr\u00e4ger. In: Kall P, L\u00fcthi HJ (eds) Operational research proceedings 1998. Springer, Berlin, pp 453\u2013462","DOI":"10.1007\/978-3-642-58409-1_44"},{"key":"331_CR13","first-page":"1","volume":"35","author":"H Kopfer","year":"2009","unstructured":"Kopfer H, Wang X (2009) Combining vehicle routing with forwarding\u2014extension of the vehicle routing problem by different types of subcontraction. J Korean Inst Indust Eng 35:1\u201314","journal-title":"J Korean Inst Indust Eng"},{"key":"331_CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00291-005-0031-2","volume":"28","author":"M Krajewska","year":"2006","unstructured":"Krajewska M, Kopfer H (2006) Collaborating freight forwarding enterprises\u2014request allocation and profit sharing. OR Spectr 28:301\u2013317","journal-title":"OR Spectr"},{"key":"331_CR15","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.ejor.2008.06.042","volume":"197","author":"M Krajewska","year":"2009","unstructured":"Krajewska M, Kopfer H (2009) Transportation planning in freight forwarding companies\u2014tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197:741\u2013751","journal-title":"Eur J Oper Res"},{"key":"331_CR16","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1057\/palgrave.jors.2602489","volume":"59","author":"M Krajewska","year":"2008","unstructured":"Krajewska M, Kopfer H, Laporte G, Ropke S, Zaccour G (2008) Horizontal cooperation of freight carriers: request allocation and profit sharing. J Oper Res Soc 59:1483\u20131491","journal-title":"J Oper Res Soc"},{"key":"331_CR17","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.tre.2005.01.004","volume":"43","author":"CG Lee","year":"2007","unstructured":"Lee CG, Kwon RH, Ma Z (2007) A carrier\u2019s optimal bid generation problem in combinatorial auctions for transportation procurement. Transport Res E 43:173\u2013191","journal-title":"Transport Res E"},{"key":"331_CR18","doi-asserted-by":"crossref","unstructured":"Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI-2001, the 13th IEEE conference on tools with artificial intelligence, Dallas, pp 160\u2013170","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"331_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1100.0327","volume":"45","author":"OO \u00d6zener","year":"2011","unstructured":"\u00d6zener OO, Ergun O, Savelsbergh M (2011) Lane-exchange mechanisms for truckload carrier collaboration. Transport Sci 45:1\u201317","journal-title":"Transport Sci"},{"key":"331_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems Part II: transportation between pickup and delivery locations. J f\u00fcr Betriebswirtschaft 58:81\u2013117","journal-title":"J f\u00fcr Betriebswirtschaft"},{"key":"331_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"JY Potvin","year":"1993","unstructured":"Potvin JY, Rousseau JM (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331\u2013340","journal-title":"Eur J Oper Res"},{"key":"331_CR22","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J Renaud","year":"2000","unstructured":"Renaud J, Boctor F, Ouenniche J (2000) A heuristic for the pickup and delivery traveling salesman problem. Comput Oper Res 27:905\u2013916","journal-title":"Comput Oper Res"},{"key":"331_CR23","doi-asserted-by":"crossref","first-page":"445","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. Transport Sci 40:445\u2013472","journal-title":"Transport Sci"},{"key":"331_CR24","unstructured":"Sch\u00f6nberger J (2005) Operational freight carrier planning. Springer, Berlin, pp 135\u2013148"},{"key":"331_CR25","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10257-008-0102-4","volume":"7","author":"M Schwind","year":"2009","unstructured":"Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. Inform Syst E-Bus Manag 7:447\u2013471","journal-title":"Inform Syst E-Bus Manag"},{"key":"331_CR26","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/trsc.1030.0053","volume":"38","author":"M Sigurd","year":"2004","unstructured":"Sigurd M, Pisinger D, Sig M (2004) Scheduling transportation of live animals to avoid the spread of diseases. Transport Sci 38:197\u2013209","journal-title":"Transport Sci"},{"key":"331_CR27","doi-asserted-by":"crossref","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 constrains. Oper Res 35:254\u2013265","journal-title":"Oper Res"},{"key":"331_CR28","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.trb.2004.11.003","volume":"39","author":"J Song","year":"2005","unstructured":"Song J, Regan A (2005) Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transport Res E 39:914\u2013933","journal-title":"Transport Res E"},{"key":"331_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00291-007-0104-5","volume":"31","author":"H Stadtler","year":"2009","unstructured":"Stadtler H (2009) A framework for collaborative planning and state-of-the-art. OR Spectr 31:5\u201330","journal-title":"OR Spectr"},{"key":"331_CR30","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16:8\u201337","journal-title":"J Finance"},{"key":"331_CR31","unstructured":"Wang X, Kopfer H (2011) Increasing efficiency of freight carriers through collaborative transport planning: chances and challenges. In: Ivanov D, Kopfer H, Haasis HD, Sch\u00f6nberger J (eds) Dynamics and sustainability in international logistics and supply chain management. Proceedings of the 6th German\u2013Russian logistics and SCM workshop (DR-LOG 2011). Cuvillier Verlag, G\u00f6ttingen, pp 41\u201350"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0331-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-013-0331-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0331-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T04:44:38Z","timestamp":1645677878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-013-0331-x"}},"subtitle":["A route-based request exchange mechanism"],"short-title":[],"issued":{"date-parts":[[2013,6,7]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s00291-013-0331-x","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,7]]}}}