{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T11:36:04Z","timestamp":1773747364110,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642410185","type":"print"},{"value":"9783642410192","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41019-2_10","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T15:31:38Z","timestamp":1379518298000},"page":"128-142","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Collaborative Transportation Planning: A Rolling Horizon Planning Approach"],"prefix":"10.1007","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Kopfer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10479-007-0179-z","volume":"153","author":"J. Abrache","year":"2007","unstructured":"Abrache, J., Crainic, T.G., Gendreau, M., Rekik, M.: Combinatorial auctions. Annals of Operations Research\u00a0153, 131\u2013164 (2007)","journal-title":"Annals of Operations Research"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G. Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.-F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research\u00a0202, 8\u201315 (2010)","journal-title":"European Journal of Operational Research"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.tre.2009.12.006","volume":"46","author":"S. Berger","year":"2010","unstructured":"Berger, S., Bierwirth, C.: Solutions to the request reassignment in collaborative carrier networks. Transportation Research E\u00a046, 627\u2013638 (2010)","journal-title":"Transportation Research E"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"Z.-L. Chen","year":"2006","unstructured":"Chen, Z.-L., Xu, H.: Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows. Transportation Science\u00a040, 74\u201388 (2006)","journal-title":"Transportation Science"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/msom.1070.0167","volume":"10","author":"C. Clifton","year":"2008","unstructured":"Clifton, C., Iyer, A., Cho, R., Jiang, W., Kantarciglu, M., Vaidya, J.: An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems. Manufacturing and Service Operations Management\u00a010, 108\u2013125 (2008)","journal-title":"Manufacturing and Service Operations Management"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"The Vehicle Routing Problem","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 157\u2013194. SIAM, Philadelphia (2002)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cruijssen, F., Br\u00e4ysy, O., Dullaert, W., Fleuren, H., Solomon, M.: Joint route planning under varying market conditions. International Journal of Physical Distribution and Logistics Management, 287\u2013304 (2007)","DOI":"10.1108\/09600030710752514"},{"key":"10_CR8","doi-asserted-by":"publisher","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.: Horizontal cooperation in logistics: Opportunities and impediments. Transportation Research E\u00a043, 129\u2013142 (2007)","journal-title":"Transportation Research E"},{"key":"10_CR9","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.: Horizontal cooperation in transport and logistics: A literature review. Transportation Journal\u00a046, 22\u201339 (2007)","journal-title":"Transportation Journal"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Cruijssen, F., Salomon, M.: Empirical Study: order sharing between transportation companies may result in cost reductions between 5 to 15 percent. Technical report, CentER Discussion Paper (2004)","DOI":"10.2139\/ssrn.607062"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research\u00a08, 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., S\u00e9guin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research C\u00a014, 157\u2013174 (2006)","journal-title":"Transportation Research C"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science\u00a033, 381\u2013390 (1999)","journal-title":"Transportation Science"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics\u00a065, 223\u2013253 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00291-005-0031-2","volume":"28","author":"M.A. Krajewska","year":"2006","unstructured":"Krajewska, M.A., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectrum\u00a028, 301\u2013317 (2006)","journal-title":"OR Spectrum"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1057\/palgrave.jors.2602489","volume":"59","author":"M.A. Krajewska","year":"2008","unstructured":"Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., Zaccour, G.: Horizontal cooperation of freight carriers: request allocation and profit sharing. Journal of the Operational Research Society\u00a059, 1483\u20131491 (2008)","journal-title":"Journal of the Operational Research Society"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S. Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research B\u00a038, 635\u2013655 (2004)","journal-title":"Transportation Research B"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization\u00a010, 327\u2013343 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1100.0327","volume":"45","author":"O. \u00d6zener","year":"2011","unstructured":"\u00d6zener, O., Ergun, O., Savelsbergh, M.: Lane-exchange mechanisms for truckload carrier collaboration. Transportation Science\u00a045, 1\u201317 (2011)","journal-title":"Transportation Science"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V. Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European Journal of Operational Research\u00a0225, 1\u201311 (2013)","journal-title":"European Journal of Operational Research"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"H.N. Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science\u00a014, 130\u2013154 (1980)","journal-title":"Transportation Science"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science\u00a040, 445\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M. Savelsbergh","year":"1998","unstructured":"Savelsbergh, M., Sol, M.: DRIVE: Dynamic Routing of Independent Vehicles. Operations Research\u00a046, 474\u2013490 (1998)","journal-title":"Operations Research"},{"key":"10_CR24","first-page":"135","volume-title":"Operational Freight Carrier Planning","author":"J. Sch\u00f6nberger","year":"2005","unstructured":"Sch\u00f6nberger, J.: Operational Freight Carrier Planning, pp. 135\u2013148. Springer, Berlin (2005)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10257-008-0102-4","volume":"7","author":"M. Schwind","year":"2009","unstructured":"Schwind, M., Gujo, O., Vykoukal, J.: A combinatorial intra-enterprise exchange for logistics services. Information Systems and e-Business Management\u00a07, 447\u2013471 (2009)","journal-title":"Information Systems and e-Business Management"},{"key":"10_CR26","unstructured":"Song, J., Regan, A.: An auction based collaborative carrier network. Technical report. Institute of Transportation Studies, University of California, Irvine (2003)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00291-007-0104-5","volume":"31","author":"H. Stadtler","year":"2009","unstructured":"Stadtler, H.: A framework for collaborative planning and state-of-the-art. OR Spectrum\u00a031, 5\u201330 (2009)","journal-title":"OR Spectrum"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation Science"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.tre.2005.01.001","volume":"42","author":"D. Tjokroamidjojo","year":"2006","unstructured":"Tjokroamidjojo, D., Kutanoglu, E., Taylor, G.D.: Quantifying the value of advance load information in truckload trucking. Transportation Research E\u00a042, 340\u2013357 (2006)","journal-title":"Transportation Research E"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickery","year":"1961","unstructured":"Vickery, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Wang, X., Kopfer, H.: Collaborative transportation planning of less-than-truckload freight: A route-based request exchange mechanism. To appear in: OR Spectrum (2013), doi:10.1007\/s00291-013-0331-x","DOI":"10.1007\/s00291-013-0331-x"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3141\/1667-13","volume":"1667","author":"J. Yang","year":"1998","unstructured":"Yang, J., Jaillet, P., Mahmassani, H.S.: On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Research Record\u00a01667, 107\u2013113 (1998)","journal-title":"Transportation Research Record"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/trsc.1030.0068","volume":"38","author":"J. Yang","year":"2004","unstructured":"Yang, J., Jaillet, P., Mahmassani, H.S.: Real-time multivehicle truckload pickup and delivery problems. Transportation Science\u00a038, 135\u2013148 (2004)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41019-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T10:30:44Z","timestamp":1646562644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410185","9783642410192"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41019-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}