{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:23:06Z","timestamp":1775150586104,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319232188","type":"print"},{"value":"9783319232195","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_45","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"654-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Joint Vehicle and Crew Routing and Scheduling"],"prefix":"10.1007","author":[{"given":"Edward","family":"Lam","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]},{"given":"Philip","family":"Kilby","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/trsc.1030.0049","volume":"38","author":"R Bent","year":"2004","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515\u2013530 (2004)","journal-title":"Transportation Science"},{"issue":"1","key":"45_CR2","doi-asserted-by":"publisher","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"},{"issue":"4","key":"45_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1287\/trsc.35.4.375.10432","volume":"35","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Stojkovi\u0107, G., Soumis, F., Desrosiers, J.: Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science 35(4), 375\u2013388 (2001)","journal-title":"Transportation Science"},{"key":"45_CR4","unstructured":"Drexl, M.: On some generalized routing problems. Ph.D. thesis, RWTH Aachen University, Aachen (2007)"},{"issue":"3","key":"45_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Synchronization in vehicle routing\u2013a survey of VRPs with multiple synchronization constraints. Transportation Science 46(3), 297\u2013316 (2012)","journal-title":"Transportation Science"},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.ejor.2012.12.015","volume":"227","author":"M Drexl","year":"2013","unstructured":"Drexl, M.: Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research 227(2), 275\u2013283 (2013)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/net.21526","volume":"63","author":"M Drexl","year":"2014","unstructured":"Drexl, M.: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1), 119\u2013133 (2014)","journal-title":"Networks"},{"issue":"2","key":"45_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BF03342751","volume":"6","author":"M Drexl","year":"2013","unstructured":"Drexl, M., Rieck, J., Sigl, T., Press, B.: Simultaneous vehicle and crew routing and scheduling for partial- and full-load long-distance road transport. BuR - Business Research 6(2), 242\u2013264 (2013)","journal-title":"BuR - Business Research"},{"issue":"3","key":"45_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3), 395\u2013412 (1969)","journal-title":"Operations Research"},{"issue":"4","key":"45_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence 34(4), 291\u2013311 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3\u20134","key":"45_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Optimization-oriented global constraints. Constraints 7(3\u20134), 351\u2013365 (2002)","journal-title":"Constraints"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-1-4419-8917-8_5","volume-title":"Constraint and Integer Programming, Operations Research\/Computer Science Interfaces Series","author":"F Focacci","year":"2004","unstructured":"Focacci, F., Lodi, A., Milano, M.: Exploiting relaxations in CP. In: Milano, M. (ed.) Constraint and Integer Programming, Operations Research\/Computer Science Interfaces Series, vol. 27, pp. 137\u2013167. Springer, US (2004)"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S1571-0653(04)00002-2","volume":"1","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving TSP through the integration of OR and CP techniques. Electronic Notes in Discrete Mathematics 1, 13\u201325 (1999)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-013-9148-0","volume":"19","author":"KG Francis","year":"2014","unstructured":"Francis, K.G., Stuckey, P.J.: Explaining circuit propagation. Constraints 19(1), 1\u201329 (2014)","journal-title":"Constraints"},{"key":"45_CR15","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-56423-9_5","volume-title":"Computer-Aided Scheduling of Public Transport","author":"R Freling","year":"2001","unstructured":"Freling, R., Huisman, D., Wagelmans, A.: Applying an integrated approach to vehicle and crew scheduling in practice. In: Vo\u00df, S., Daduna, J. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 73\u201390. Springer, Berlin Heidelberg (2001)"},{"issue":"1","key":"45_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1022287504028","volume":"6","author":"R Freling","year":"2003","unstructured":"Freling, R., Huisman, D., Wagelmans, A.: Models and algorithms for integration of vehicle and crew scheduling. Journal of Scheduling 6(1), 63\u201385 (2003)","journal-title":"Journal of Scheduling"},{"key":"45_CR17","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-85970-0_21","volume-title":"Computer-Aided Transit Scheduling","author":"R Freling","year":"1999","unstructured":"Freling, R., Wagelmans, A., Paix\u00e3o, J.: An overview of models and techniques for integrating vehicle and crew scheduling. In: Wilson, N. (ed.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol. 471, pp. 441\u2013460. Springer, Berlin Heidelberg (1999)"},{"issue":"3","key":"45_CR18","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","volume":"35","author":"K Haase","year":"2001","unstructured":"Haase, K., Desaulniers, G., Desrosiers, J.: Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3), 286\u2013303 (2001)","journal-title":"Transportation Science"},{"issue":"1","key":"45_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2005.01.005","volume":"173","author":"B Hollis","year":"2006","unstructured":"Hollis, B., Forbes, M., Douglas, B.: Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post. European Journal of Operational Research 173(1), 133\u2013150 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"45_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/1015031","volume":"15","author":"T Ibaraki","year":"1973","unstructured":"Ibaraki, T.: Algorithms for obtaining shortest paths visiting specified nodes. SIAM Review 15(2), 309\u2013317 (1973)","journal-title":"SIAM Review"},{"issue":"4","key":"45_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1009808327381","volume":"5","author":"P Kilby","year":"2000","unstructured":"Kilby, P., Prosser, P., Shaw, P.: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints 5(4), 389\u2013414 (2000)","journal-title":"Constraints"},{"issue":"12","key":"45_CR22","doi-asserted-by":"publisher","first-page":"8424","DOI":"10.1016\/j.eswa.2010.05.036","volume":"37","author":"BI Kim","year":"2010","unstructured":"Kim, B.I., Koo, J., Park, J.: The combined manpower-vehicle routing problem for multi-staged services. Expert Systems with Applications 37(12), 8424\u20138431 (2010)","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"45_CR23","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G Laporte","year":"2007","unstructured":"Laporte, G.: What you should know about the vehicle routing problem. Naval Research Logistics (NRL) 54(8), 811\u2013819 (2007)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"45_CR24","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1051\/ro\/1984180302031","volume":"18","author":"G Laporte","year":"1984","unstructured":"Laporte, G., Mercure, H., Norbert, Y.: Optimal tour planning with specified nodes. RAIRO - Operations Research - Recherche Op\u00e9rationnelle 18(3), 203\u2013210 (1984)","journal-title":"RAIRO - Operations Research - Recherche Op\u00e9rationnelle"},{"issue":"6","key":"45_CR25","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.cor.2003.11.013","volume":"32","author":"A Mercier","year":"2005","unstructured":"Mercier, A., Cordeau, J.F., Soumis, F.: A computational study of benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research 32(6), 1451\u20131476 (2005)","journal-title":"Computers & Operations Research"},{"issue":"8","key":"45_CR26","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1016\/j.cor.2005.09.001","volume":"34","author":"A Mercier","year":"2007","unstructured":"Mercier, A., Soumis, F.: An integrated aircraft routing, crew scheduling and flight retiming model. Computers & Operations Research 34(8), 2251\u20132265 (2007)","journal-title":"Computers & Operations Research"},{"key":"45_CR27","doi-asserted-by":"crossref","unstructured":"Mesquita, M., Paias, A.: Set partitioning\/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers & Operations Research 35(5), 1562\u20131575 (2008), part Special Issue: Algorithms and Computational Methods in Feasibility and Infeasibility","DOI":"10.1016\/j.cor.2006.09.001"},{"issue":"1","key":"45_CR28","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"LM Rousseau","year":"2002","unstructured":"Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics 8(1), 43\u201358 (2002)","journal-title":"Journal of Heuristics"},{"key":"45_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"45_CR30","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"45_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-40627-0_5","volume-title":"Principles and Practice of Constraint Programming","author":"P Van Hentenryck","year":"2013","unstructured":"Van Hentenryck, P., Michel, L.: The Objective-CP Optimization System. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 8\u201329. Springer, Heidelberg (2013)"},{"issue":"11","key":"45_CR32","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1057\/jors.1987.177","volume":"38","author":"T Volgenant","year":"1987","unstructured":"Volgenant, T., Jonker, R.: On some generalizations of the travelling-salesman problem. The Journal of the Operational Research Society 38(11), 1073\u20131079 (1987)","journal-title":"The Journal of the Operational Research Society"},{"key":"45_CR33","doi-asserted-by":"crossref","unstructured":"Yu, G.: Operations Research in the Airline Industry. International Series in Operations Research & Management Science: 9, Springer, US (1998)","DOI":"10.1007\/978-1-4615-5501-8"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:02:42Z","timestamp":1676966562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}