{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:55:01Z","timestamp":1760820901462,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684956"},{"type":"electronic","value":"9783319684963"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68496-3_8","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T08:25:00Z","timestamp":1506414300000},"page":"110-126","source":"Crossref","is-referenced-by-count":3,"title":["Time-Dependent Route Planning for\u00a0Truck\u00a0Drivers"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kleff","sequence":"first","affiliation":[]},{"given":"Christian","family":"Br\u00e4uer","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Valentin","family":"Buchhold","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"Baum","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"8_CR1","unstructured":"Truck Parking Europe. \nhttps:\/\/truckparkingeurope.com\/"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","volume-title":"Algorithm Engineering","author":"H Bast","year":"2016","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route Planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19\u201380. Springer, Cham (2016). doi:\n10.1007\/978-3-319-49487-6_2"},{"key":"8_CR3","first-page":"1.4:1","volume":"18","author":"GV Batz","year":"2013","unstructured":"Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum Time-Dependent Travel Times with Contraction Hierarchies. ACM J. Exp. Algorithmics 18, 1.4:1\u20131.4:43 (2013)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"8_CR4","unstructured":"Batz, G.V.: KaTCH. \nhttps:\/\/github.com\/GVeitBatz\/KaTCH\/"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Z\u00fcndorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. In: ACM SIGSPATIAL 2015, pp. 44:1\u201344:10. ACM (2015)","DOI":"10.1145\/2820783.2820826"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-38851-9_3","volume-title":"Experimental Algorithms","author":"M Baum","year":"2016","unstructured":"Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Dynamic time-dependent route planning in road networks with user preferences. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 33\u201349. Springer, Cham (2016). doi:\n10.1007\/978-3-319-38851-9_3"},{"issue":"3","key":"8_CR7","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Internodal Transit Times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"8_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"BC Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies. Networks 44(1), 41\u201346 (2004)","journal-title":"Networks"},{"issue":"1","key":"8_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/ijoc.1110.0448","volume":"24","author":"D Delling","year":"2012","unstructured":"Delling, D., Nannicini, G.: Core Routing on Dynamic Time-Dependent Road Networks. Informs J. Comput. 24(2), 187\u2013201 (2012)","journal-title":"Informs J. Comput."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207\u2013230. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-05465-5_8"},{"issue":"1","key":"8_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"8_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12159-010-0022-9","volume":"2","author":"M Drexl","year":"2010","unstructured":"Drexl, M., Prescott-Gagnon, E.: Labelling Algorithms for the Elementary Shortest Path Problem with Resource Constraints Considering EU Drivers\u2019 Rules. Logistics Research 2(2), 79\u201396 (2010)","journal-title":"Logistics Research"},{"issue":"3","key":"8_CR14","doi-asserted-by":"crossref","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. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"8_CR15","unstructured":"European Parliament, Council of the European Union: Regulation (EC) No. 561\/2006 of the European Parliament and of the Council of 15 March 2006 on the harmonisation of certain social legislation relating to road transport and amending Council Regulations (EEC) No. 3821\/85 and (EC) No. 2135\/98 and repealing Council Regulation (EEC) No. 3820\/85. OJ L 102(1), 1\u201313 (2006)"},{"key":"8_CR16","unstructured":"Federal Motor Carrier Safety Administration: Hours of Service of Drivers. Fed. Reg. 76(248), 81133\u201381188 (2011)"},{"issue":"4","key":"8_CR17","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1007\/s00453-012-9714-7","volume":"68","author":"L Foschini","year":"2014","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the Complexity of Time-Dependent Shortest Paths. Algorithmica 68(4), 1075\u20131097 (2014)","journal-title":"Algorithmica"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.trb.2013.08.008","volume":"56","author":"A Franceschetti","year":"2013","unstructured":"Franceschetti, A., Honhon, D., Van Woensel, T., Bekta\u015f, T., Laporte, G.: The Time-Dependent Pollution-Routing Problem. Transportation Res. B - Meth. 56, 265\u2013293 (2013)","journal-title":"Transportation Res. B - Meth."},{"key":"8_CR19","unstructured":"Geisberger, R., Sanders, P.: Engineering time-dependent many-to-many shortest paths computation. In: ATMOS 2010, OASIcs, vol. 14, pp. 74\u201387 (2010)"},{"issue":"3","key":"8_CR20","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transport. Sci. 46(3), 388\u2013404 (2012)","journal-title":"Transport. Sci."},{"issue":"4","key":"8_CR21","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/trsc.1100.0330","volume":"44","author":"A Goel","year":"2010","unstructured":"Goel, A.: Truck Driver Scheduling in the European Union. Transport. Sci. 44(4), 429\u2013441 (2010)","journal-title":"Transport. Sci."},{"key":"8_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.tranpol.2014.02.005","volume":"33","author":"A Goel","year":"2014","unstructured":"Goel, A.: Hours of Service Regulations in the United States and the 2013 Rule Change. Transp. Policy 33, 48\u201355 (2014)","journal-title":"Transp. Policy"},{"issue":"3","key":"8_CR23","first-page":"159","volume":"9","author":"H Imai","year":"1987","unstructured":"Imai, H., Iri, M.: An Optimal Algorithm for Approximating a Piecewise Linear Function. Journal of Information Processing 9(3), 159\u2013162 (1987)","journal-title":"Journal of Information Processing"},{"key":"8_CR24","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/j.trb.2016.08.006","volume":"93","author":"C Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, C., Bekta\u015f, T., Jabali, O., Laporte, G.: A Comparison of Three Idling Options in Long-Haul Truck Scheduling. Transportation Res. B - Meth. 93, 631\u2013647 (2016). Part A","journal-title":"Transportation Res. B - Meth."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7., Jabali, O., Laporte, G.: Long-Haul Vehicle Routing and Scheduling with Idling Options. J. Oper. Res. Soc. (forthcoming)","DOI":"10.1057\/s41274-017-0202-y"},{"issue":"3","key":"8_CR26","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.ejor.2010.10.017","volume":"210","author":"A Kok","year":"2011","unstructured":"Kok, A., Hans, E., Schutten, J.: Optimizing Departure Times in Vehicle Routes. Eur. J. Oper. Res. 210(3), 579\u2013587 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR27","unstructured":"Shah, V.D.: Time Dependent Truck Routing and Driver Scheduling Problem with Hours of Service Regulations. Master\u2019s thesis, Northeastern University (2008)"},{"issue":"4","key":"8_CR28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<259::AID-NET6>3.0.CO;2-C","volume":"31","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Ozbay, K., Subramanian, S.: The Time-Dependent Shortest Pair of Disjoint Paths Problem: Complexity, Models, and Algorithms. Networks 31(4), 259\u2013272 (1998)","journal-title":"Networks"},{"issue":"5","key":"8_CR29","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.cor.2011.07.017","volume":"39","author":"OJ Smith","year":"2012","unstructured":"Smith, O.J., Boland, N., Waterer, H.: Solving Shortest Path Problems with a Weight Constraint and Replenishment Arcs. Comput. Oper. Res. 39(5), 964\u2013984 (2012)","journal-title":"Comput. Oper. Res."},{"key":"8_CR30","unstructured":"Strasser, B.: Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks. CoRR abs\/1606.06636 (2016)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68496-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T11:56:06Z","timestamp":1506945366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68496-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684956","9783319684963"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68496-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}