{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:00:14Z","timestamp":1776751214689,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s43069-020-00049-6","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T11:02:58Z","timestamp":1610103778000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information"],"prefix":"10.1007","volume":"2","author":[{"given":"Hamza","family":"Ben Ticha","sequence":"first","affiliation":[]},{"given":"Nabil","family":"Absi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1246-223X","authenticated-orcid":false,"given":"Dominique","family":"Feillet","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Quilliot","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Van Woensel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"issue":"6","key":"49_CR1","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/0305-0483(81)90055-4","volume":"9","author":"JE Beasley","year":"1981","unstructured":"Beasley JE (1981) Adapting the savings algorithm for varying inter-customer travel times. Omega 9(6):658\u2013659","journal-title":"Omega"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2018.11.001","volume":"104","author":"HB Ticha","year":"2019","unstructured":"Ticha HB, Absi N, Feillet D, Quilliot A (2019) Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows. Comput Oper Res 104:113\u2013126","journal-title":"Comput Oper Res"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.cor.2017.06.024","volume":"88","author":"HB Ticha","year":"2017","unstructured":"Ticha HB, Absi N, Feillet D, Quilliot A (2017) Empirical analysis for the vrptw with a multigraph representation for the road network. Comput Oper Res 88:103\u2013116","journal-title":"Comput Oper Res"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.21808","volume":"72","author":"HB Ticha","year":"2018","unstructured":"Ticha HB, Absi N, Feillet D, information Alain Quilliot. (2018) Vehicle routing problems with road-network State of the art. Networks 72:393\u2013406","journal-title":"Networks"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Ticha HB, Absi N, Feillet D, Quilliot A, Van T (2019) Woensel. A branch-and-price algorithm for the vehicle routing problem with time windows on a road-network graph. Networks 73(4):401\u2013417","DOI":"10.1002\/net.21852"},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/trsc.1120.0449","volume":"48","author":"J-F Cordeau","year":"2012","unstructured":"Cordeau J-F, Ghiani G, Guerriero E (2012) Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Transp Sci 48(1):46\u201358","journal-title":"Transp Sci"},{"issue":"3","key":"49_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/trsc.1120.0445","volume":"47","author":"S Dabia","year":"2013","unstructured":"Dabia S, Ropke S, Woensel TV, Kok TD (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transp Sci 47(3):380\u2013396","journal-title":"Transp Sci"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Delling D., Wagner D. (2009) Time-Dependent Route Planning. In: Ahuja R.K., M\u00f6hring R.H., Zaroliagis C.D. (eds) Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, vol 5868. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-05465-5_8"},{"issue":"3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1016\/j.ejor.2006.06.047","volume":"185","author":"AV Donati","year":"2008","unstructured":"Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res 185(3):1174\u20131191","journal-title":"Eur J Oper Res"},{"issue":"12","key":"49_CR10","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1016\/j.cor.2005.03.029","volume":"33","author":"R Eglese","year":"2006","unstructured":"Eglese R, Maden W, Slater A (2006) A road timetable to aid vehicle routing and scheduling. Comput Oper Res 33(12):3508\u20133519","journal-title":"Comput Oper Res"},{"issue":"4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","volume":"8","author":"D Feillet","year":"2010","unstructured":"Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR Q J Oper Res 8(4):407\u2013424","journal-title":"4OR Q J Oper Res"},{"issue":"3","key":"49_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints Application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"issue":"3","key":"49_CR13","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.tre.2011.11.006","volume":"48","author":"MA Figliozzi","year":"2012","unstructured":"Figliozzi MA (2012) The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics. Transp Res E Logist Transp Rev 48(3):616\u2013636","journal-title":"Transp Res E Logist Transp Rev"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1287\/trsc.1030.0062","volume":"38","author":"B Fleischmann","year":"2004","unstructured":"Fleischmann B, Gietz M, Gnutzmann S (2004) Time-varying travel times in vehicle routing. Transp Sci 38(2):160\u2013173","journal-title":"Transp Sci"},{"issue":"1","key":"49_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2009.10.002","volume":"204","author":"T Garaix","year":"2010","unstructured":"Garaix T, Artigues C, Feillet D, paths Didier Josselin. (2010) Vehicle routing problems with alternative An application to on-demand transportation. Eur J Oper Res 204(1):62\u201375","journal-title":"Eur J Oper Res"},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2015.06.001","volume":"64","author":"M Gendreau","year":"2015","unstructured":"Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: a review. Comput Oper Res 64:189\u2013197","journal-title":"Comput Oper Res"},{"issue":"3","key":"49_CR17","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/trsc.2013.0491","volume":"48","author":"G Ghiani","year":"2014","unstructured":"Ghiani G, Guerriero E (2014) A note on the Ichoua, Gendreau, and Potvin (2003) travel time model. Transp Sci 48(3):458\u2013462","journal-title":"Transp Sci"},{"key":"49_CR18","unstructured":"Gmira M (2019) Confection de tourn\u00e9es de livraison dans un r\u00e9seau urbain \u00e0 l\u2019aide de m\u00e9taheuristiques et de m\u00e9thodes de forage de donn\u00e9es massives. PhD thesis. Polytechnique Montr\u00e9al"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Gmira M, Gendreau M, Lodi A, Potvin J-Y (2020) Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur J Oper Res","DOI":"10.1016\/j.ejor.2020.05.041"},{"key":"49_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges, vol 43","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer Science & Business Media, New York"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Hansen P (1980) Bicriterion path problems. In: Multiple criteria decision making theory and application. Springer, pp 109\u2013127","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"49_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trb.2016.10.013","volume":"95","author":"Y Huang","year":"2017","unstructured":"Huang Y, Zhao L, Woensel TV, Gross J-P (2017) Time-dependent vehicle routing problem with path flexibility. Transp Res B Methodol 95:169\u2013195","journal-title":"Transp Res B Methodol"},{"issue":"2","key":"49_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396","journal-title":"Eur J Oper Res"},{"issue":"6","key":"49_CR24","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1111\/j.1937-5956.2012.01338.x","volume":"21","author":"O Jabali","year":"2012","unstructured":"Jabali O, van Woensel T, de Kok T (2012) Analysis of travel times and co2 emissions in time-dependent vehicle routing. Prod Oper Manag 21 (6):1060\u20131074","journal-title":"Prod Oper Manag"},{"issue":"1","key":"49_CR25","first-page":"1","volume":"1","author":"DE Kaufman","year":"1993","unstructured":"Kaufman DE, Smith RL (1993) Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. J Intell Transp Syst 1 (1):1\u201311","journal-title":"J Intell Transp Syst"},{"issue":"5","key":"49_CR26","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.cor.2011.05.027","volume":"39","author":"AL Kok","year":"2012","unstructured":"Kok AL, Hans EW, Schutten JMJ (2012) Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Comput Oper Res 39 (5):910\u2013918","journal-title":"Comput Oper Res"},{"key":"49_CR27","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","volume":"86","author":"DSW Lai","year":"2016","unstructured":"Lai DSW, Demirag OC, Leung JMY (2016) A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp Res E Logist Transp Rev 86:32\u201352","journal-title":"Transp Res E Logist Transp Rev"},{"issue":"4","key":"49_CR28","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43 (4):408\u2013416","journal-title":"Transp Sci"},{"key":"49_CR29","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cor.2014.06.022","volume":"51","author":"AN Letchford","year":"2014","unstructured":"Letchford AN, Nasiri SD, Oukil A (2014) Pricing routines for vehicle routing with time windows on road networks. Comput Oper Res 51:331\u2013337","journal-title":"Comput Oper Res"},{"issue":"3","key":"49_CR30","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda A, Rom R (1990) Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J ACM (JACM) 37(3):607\u2013625","journal-title":"J ACM (JACM)"},{"issue":"2","key":"49_CR31","first-page":"234","volume":"30","author":"A Patoghi","year":"2017","unstructured":"Patoghi A, Shakeri Z, Setak M (2017) A time dependent pollution routing problem in multi-graph. Int J Eng 30(2):234\u2013242","journal-title":"Int J Eng"},{"issue":"3","key":"49_CR32","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 (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret Optim 3(3):255\u2013273","journal-title":"Discret Optim"},{"key":"49_CR33","doi-asserted-by":"crossref","unstructured":"Serafini P (1987) Some considerations about computational complexity for multi objective combinatorial problems. In: Recent advances and historical development of vector optimization. Springer, pp 222\u2013232","DOI":"10.1007\/978-3-642-46618-2_15"},{"issue":"35","key":"49_CR34","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.jmsy.2014.11.016","volume":"35","author":"M Setak","year":"2015","unstructured":"Setak M, Habibi M, Karimi H, Abedzadeh M (2015) A time-dependent vehicle routing problem in multigraph with fifo property. J Manuf Syst 35(35):37\u201345","journal-title":"J Manuf Syst"},{"key":"49_CR35","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.asoc.2018.10.029","volume":"74","author":"H Tikani","year":"2019","unstructured":"Tikani H, Setak M (2019) Efficient solution algorithms for a time-critical reliable transportation problem in multigraph networks with fifo property. Appl Soft Comput 74:504\u2013528","journal-title":"Appl Soft Comput"},{"key":"49_CR36","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications. SIAM","DOI":"10.1137\/1.9781611973594"},{"issue":"4","key":"49_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2013.12.036","volume":"3","author":"H-F Wang","year":"2014","unstructured":"Wang H-F, Lee Y-Y (2014) Two-stage particle swarm optimization algorithm for the time dependent alternative vehicle routing problem. J Appl Comput Math 3(4):1\u20139","journal-title":"J Appl Comput Math"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00049-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00049-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00049-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:21:47Z","timestamp":1637241707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00049-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,8]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["49"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00049-6","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,8]]},"assertion":[{"value":"20 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"4"}}