{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:39:23Z","timestamp":1725849563605},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286952"},{"type":"electronic","value":"9783319286976"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28697-6_67","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T06:10:47Z","timestamp":1455948647000},"page":"481-486","source":"Crossref","is-referenced-by-count":6,"title":["Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Salani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Battarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"key":"67_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1057\/jors.1993.53","volume":"44","author":"N Balakrishnan","year":"1993","unstructured":"Balakrishnan, N.: Simple heuristics for the vehicle routeing problem with soft time windows. J. Oper. Res. Soc. 44, 279\u2013287 (1993)","journal-title":"J. Oper. Res. Soc."},{"key":"67_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tre.2013.12.003","volume":"62","author":"N Bhusiri","year":"2014","unstructured":"Bhusiri, N., Qureshi, A., Taniguchi, E.: The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem. Transp. Res. Part E: Logistics Transp. Rev. 62, 1\u201322 (2014)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"67_CR3","first-page":"295","volume":"31","author":"H Calvete","year":"2004","unstructured":"Calvete, H., Gal, C., Oliveros, M., S\u00e1nchez-Valverde, B.: Vehicle routing problems with soft time windows: an optimization based approach. Monograf\u2019ias del Seminario Matem\u00e1tico Garc\u00eda de Galdeano 31, 295\u2013304 (2004)","journal-title":"Monograf\u2019ias del Seminario Matem\u00e1tico Garc\u00eda de Galdeano"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Caramia, M., Dell\u2019 Olmo, P. (eds.): Multi-objective Management in Freight Logistics. Springer, London (2008)","DOI":"10.1007\/978-1-84800-382-8"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","volume":"55","author":"WC Chang","year":"2004","unstructured":"Chang, W.C., Russell, R.: A metaheuristic for the vehicle-routeing problem with soft time windows. J. Oper. Res. Soc. 55, 1298\u20131310 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"67_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M. (eds.): Column generation. GERAD 25th Anniversary Series. Springer (2005)","DOI":"10.1007\/b135457"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"M Figliozzi","year":"2010","unstructured":"Figliozzi, M.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp. Res. Part C: Emerg. Technol. 18, 668\u2013679 (2010)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"67_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","volume":"59","author":"Z Fu","year":"2008","unstructured":"Fu, Z., Eglese, R., Li, L.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. Oper. Res. Soc. 59, 663\u2013673 (2008)","journal-title":"J. Oper. Res. Soc."},{"key":"67_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1030.0085","volume":"39","author":"T Ibaraki","year":"2005","unstructured":"Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transp. Sci. 39, 206\u2013232 (2005)","journal-title":"Transp. Sci."},{"issue":"1","key":"67_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-010-0136-6","volume":"9","author":"Federico Liberatore","year":"2010","unstructured":"Liberatore, F., Righini, G., Salani, M.: A column generation algorithm for the vehicle routing problem with soft time windows. 4OR: A Quarterly J. Oper. Res. 9, 49\u201382 (2011)","journal-title":"4OR"},{"key":"67_CR12","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.tre.2009.04.007","volume":"45","author":"A Qureshi","year":"2009","unstructured":"Qureshi, A., Taniguchi, E., Yamada, T.: An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transp. Res. Part E: Logistics Transp. Rev. 45, 960\u2013977 (2009)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"issue":"3","key":"67_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3(3), 255\u2013273 (2006)","journal-title":"Discret. Optim."},{"key":"67_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained shortest path problem. Networks 51, 155\u2013170 (2008)","journal-title":"Networks"},{"key":"67_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/net.3230110212","volume":"11","author":"L Schrage","year":"1981","unstructured":"Schrage, L.: Formulation and structure of more complex\/realistic routing and scheduling problems. Networks 11, 229\u2013232 (1981)","journal-title":"Networks"},{"key":"67_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/trsc.19.4.378","volume":"19","author":"T Sexton","year":"1985","unstructured":"Sexton, T., Bodin, L.: Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling. Transp. Sci. 19, 378\u2013410 (1985a)","journal-title":"Transp. Sci."},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/trsc.19.4.411","volume":"19","author":"T Sexton","year":"1985","unstructured":"Sexton, T., Bodin, L.: Optimizing single vehicle many-to-many operations with desired delivery times: Ii. routing. Transp. Sci. 19, 411\u2013435 (1985b)","journal-title":"Transp. Sci."},{"key":"67_CR18","first-page":"369","volume":"6","author":"T Sexton","year":"1986","unstructured":"Sexton, T., Choi, Y.M.: Pickup and delivery of partial loads with \u201csoft\u201d time windows. Am. J. Math. Manage. Sci. 6, 369\u2013398 (1986)","journal-title":"Am. J. Math. Manage. Sci."},{"key":"67_CR19","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. Transp. Sci. 31, 170\u2013186 (1997)","journal-title":"Transp. Sci."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28697-6_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T13:52:49Z","timestamp":1718373169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28697-6_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286952","9783319286976"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28697-6_67","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2016]]}}}