{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:23:22Z","timestamp":1773523402372,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s12532-014-0064-0","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T16:17:31Z","timestamp":1391185051000},"page":"171-197","source":"Crossref","is-referenced-by-count":53,"title":["A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows"],"prefix":"10.1007","volume":"6","author":[{"given":"Andrea","family":"Bettinelli","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,1]]},"reference":[{"key":"64_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"64_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1057\/jors.1993.53","volume":"44","author":"N Balakrishnan","year":"1993","unstructured":"Balakrishnan, N.: Simple heuristics for the vehicle routing problem with soft time windows. J. Oper. Res. Soc. 44, 279\u2013287 (1993)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"64_CR3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414\u2013426 (2011)","journal-title":"Oper. Res."},{"key":"64_CR4","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59, 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"64_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15(1), 1\u201331 (2007)","journal-title":"Top"},{"key":"64_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","volume":"34","author":"B Boland","year":"2006","unstructured":"Boland, B., Dethridge, J., Dumitrescu, I.: Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34, 58\u201368 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"64_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/trsc.1080.0256","volume":"43","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a rich vehicle-routing problem. Transp. Sci. 43(1), 56\u201369 (2009)","journal-title":"Transp. Sci."},{"key":"64_CR8","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","volume":"55","author":"WC Chiang","year":"2004","unstructured":"Chiang, W.C., Russell, R.A.: 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":"64_CR9","doi-asserted-by":"crossref","unstructured":"Contardo, C., Cordeau, J.-F., Gendron, B.: An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J. Comput. 2013 (forthcoming)","DOI":"10.1287\/ijoc.2013.0549"},{"key":"64_CR10","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573\u2013586 (2006)","journal-title":"Oper. Res."},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Laporte, G., Ropke, S.: Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden, B.l., Raghavan, S., Wasil, E.A. (eds.) Vehicle Routing: Latest Advances and Challenges, pp. 327\u2013357. Springer, Berlin (2008)","DOI":"10.1007\/978-0-387-77778-8_15"},{"issue":"5","key":"64_CR12","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M Dror","year":"1994","unstructured":"Dror, M.: Note on the complexity of the shortest path models for column generation in vrptw. Oper. Res. 42(5), 977\u2013978 (1994)","journal-title":"Oper. Res."},{"key":"64_CR13","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.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54, 7\u201322 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"64_CR14","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path with resource constraints: application to some vehicle routing problems. Networks 44, 216\u2013229 (2004)","journal-title":"Networks"},{"key":"64_CR15","doi-asserted-by":"crossref","unstructured":"Golden, B.l., Raghavan, S., Wasil, E.A. (eds.): Vehicle Routing: Latest Advances and Challenges. Springer, Berlin (2008)","DOI":"10.1007\/978-0-387-77778-8"},{"key":"64_CR16","doi-asserted-by":"crossref","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."},{"key":"64_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","volume":"26","author":"YA Koskosidis","year":"1992","unstructured":"Koskosidis, Y.A., Powell, W.B., Solomon, M.M.: An optimization based heuristic for vehicle routing and scheduling with soft time window constraints. Transp. Sci. 26, 69\u201385 (1992)","journal-title":"Transp. Sci."},{"key":"64_CR18","doi-asserted-by":"crossref","unstructured":"Liberatore, F., Salani, M., Righini, G.: A pricing algorithm for the vehicle routing problem with soft time windows. In: Bertazzi, L., Speranza, M.G., van Nunen, J.A.E.E. (eds.) Proceedings of the International Workshop on Distribution Logistics 2006, vol. 619, pp. 251\u2013266, Brescia (2009)","DOI":"10.1007\/978-3-540-92944-4_13"},{"key":"64_CR19","doi-asserted-by":"crossref","unstructured":"Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems: Part ii: Transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft 58 (2008)","DOI":"10.1007\/s11301-008-0036-4"},{"key":"64_CR20","unstructured":"Pecin, D., Poggi, M., Martinelli, R.: Efficient elementary and restricted non-elementary route pricing. Technical Report 11\/13, PUC-Rio (2013)"},{"key":"64_CR21","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.tre.2009.04.007","volume":"45","author":"AG Qureshi","year":"2009","unstructured":"Qureshi, A.G., Taniguchi, E., Yamada, T.: An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transp. Res. Part E Logist. Transp. Rev. 45, 960\u2013977 (2009)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"64_CR22","doi-asserted-by":"crossref","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 elementary shortest path problem. Networks 51, 155\u2013170 (2008)","journal-title":"Networks"},{"key":"64_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery problem with time windows. Transp. Sci. 43, 267\u2013286 (2009)","journal-title":"Transp. Sci."},{"key":"64_CR24","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49, 258\u2013272 (2007)","journal-title":"Networks"},{"key":"64_CR25","unstructured":"Salani, M.: Branch-and-Price Algorithms for Vehicle Routing Problems. PhD thesis, Universit\u00e0 degli Studi di Milano (2006)"},{"key":"64_CR26","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29, 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"64_CR27","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"29","author":"MWP Savelsbergh","year":"1998","unstructured":"Savelsbergh, M.W.P., Sol, M.: Drive: Dynamic routing of independent vehicles. Oper. Res. 29, 474\u2013490 (1998)","journal-title":"Oper. Res."},{"key":"64_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17676-0","volume-title":"Guide to Supply Chain Management","author":"C Scott","year":"2011","unstructured":"Scott, C., Lundgren, H., Thompson, P.: Guide to Supply Chain Management. Springer, Berlin (2011)"},{"key":"64_CR29","first-page":"369","volume":"6","author":"TR Sexton","year":"1986","unstructured":"Sexton, T.R., Choi, Y.M.: Pickup and delivery of partial loads with soft time windows. Am. J. Math. Manage. Sci. 6, 369\u2013398 (1986)","journal-title":"Am. J. Math. Manage. Sci."},{"key":"64_CR30","doi-asserted-by":"crossref","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":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0064-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0064-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0064-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:44:15Z","timestamp":1565142255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0064-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0064-0","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,1]]}}}