{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:54:34Z","timestamp":1742921674004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_9","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"57-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Branch-and-Price on the Split Delivery Vehicle Routing Problem with Time Windows and Alternative Delivery Periods"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Breier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Gossler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/trsc.1050.0117","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti, C., Savelsbergh, M., & Speranza, M. G. (2006). Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 40(2), 226\u2013234.","journal-title":"Transportation Science"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.20467","volume":"58","author":"C Archetti","year":"2011","unstructured":"Archetti, C., Bianchessi, N., & Speranza, M. G. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), 241\u2013254.","journal-title":"Networks"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1\u20136.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"9_CR4","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J Desrosiers","year":"1984","unstructured":"Desrosiers, J., Soumis, F., & Desrochers, M. (1984). Routing with time windows by column generation. Networks, 14(4), 545\u2013565.","journal-title":"Networks"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","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. Operations Research, 58(1), 179\u2013192.","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2010). The vehicle routing problem with time windows: State-of-the-art exact solution methods. In: J.J. Cochrane (Ed.), Wiley encyclopedia of operations research and management science (Vol. 8, pp. 5742\u20135749). Wiley. http:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/9780470400531.eorms1034\/abstract.","key":"9_CR7","DOI":"10.1002\/9780470400531.eorms1034"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141.","journal-title":"Transportation Science"},{"doi-asserted-by":"crossref","unstructured":"Feillet, D. (2010). A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research.","key":"9_CR9","DOI":"10.1007\/s10288-010-0130-z"},{"issue":"6","key":"9_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/0305-0548(94)00040-F","volume":"22","author":"PW Frizzell","year":"1995","unstructured":"Frizzell, P. W., & Giffin, J. W. (1995). The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research, 22(6), 655\u2013667.","journal-title":"Computers and Operations Research"},{"unstructured":"Gendreau, M., Dejax, P., Feillet, D., & Gueguen, C. (2006). Vehicle routing with time windows and split deliveries. Laboratoire Informatique dAvignon, Technical report.","key":"9_CR11"},{"unstructured":"Pirkwieser, S., & Raidl, G. (2009). A column generation approach for the periodic vehicle routing problem with time windows. Proceedings of the International Network Optimization Conference.","key":"9_CR12"},{"unstructured":"Salani, M., & Vacca, I. (2009). Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Transport and Mobility Laboratory, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Technical report.","key":"9_CR13"},{"unstructured":"Solomon, M. M. (1983). Vehicle routing and scheduling with time windows constraints: Models and algorithms (PhD thesis, University of Pennsylvania).","key":"9_CR14"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T01:46:26Z","timestamp":1675820786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_9","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}