{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:36Z","timestamp":1740149136159,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:00:00Z","timestamp":1620000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:00:00Z","timestamp":1620000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61703372"],"award-info":[{"award-number":["61703372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-021-00639-0","type":"journal-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T19:52:31Z","timestamp":1620071551000},"page":"2943-2972","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Time-dependent rural postman problem: time-space network formulation and genetic algorithm"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1024-4135","authenticated-orcid":false,"given":"Jianbin","family":"Xin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benyang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"D\u2019Ariano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heshan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,3]]},"reference":[{"key":"639_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1057\/jors.1991.81","volume":"42","author":"BH Ahn","year":"1991","unstructured":"Ahn BH, Shin JY (1991) Vehicle-routeing with time windows and time-varying congestion. J Opera Res Soc 42:393\u2013400","journal-title":"J Opera Res Soc"},{"key":"639_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/0305-0483(81)90055-4","volume":"9","author":"J Beasley","year":"1981","unstructured":"Beasley J (1981) Adapting the savings algorithm for varying inter-customer travel times. Omega 9:658\u2013659","journal-title":"Omega"},{"key":"639_CR3","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.cor.2012.08.001","volume":"40","author":"D Black","year":"2013","unstructured":"Black D, Eglese R, W\u00f8hlk S (2013) The time-dependent prize-collecting arc routing problem. Comput Oper Res 40:526\u2013535","journal-title":"Comput Oper Res"},{"key":"639_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11750-019-00514-4","volume":"27","author":"NL Boland","year":"2019","unstructured":"Boland NL, Savelsbergh MW (2019) Perspectives on integer programming for time-dependent models. Top 27:147\u2013173","journal-title":"Top"},{"key":"639_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2018.07.016","volume":"102","author":"T Calogiuri","year":"2019","unstructured":"Calogiuri T, Ghiani G, Guerriero E, Mansini R (2019) A branch-and-bound algorithm for the time-dependent rural postman problem. Comput Oper Res 102:150\u2013157","journal-title":"Comput Oper Res"},{"key":"639_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1287\/trsc.2016.0686","volume":"51","author":"M Colombi","year":"2017","unstructured":"Colombi M, Corber\u00e1n \u00c1, Mansini R, Plana I, Sanchis JM (2017) The hierarchical mixed rural postman problem. Transp Sci 51:755\u2013770","journal-title":"Transp Sci"},{"key":"639_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.21965","volume":"77","author":"\u00c1 Corber\u00e1n","year":"2021","unstructured":"Corber\u00e1n \u00c1, Eglese R, Hasle G, Plana I, Sanchis JM (2021) Arc routing problems: a review of the past, present, and future. Networks 77:88\u2013115","journal-title":"Networks"},{"key":"639_CR8","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n \u00c1, Laporte G (2014) Arc routing: problems, methods, and applications. MOS-SIAM Series on (Optimization)","DOI":"10.1137\/1.9781611973679"},{"key":"639_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20347","volume":"56","author":"A Corber\u00e1n","year":"2010","unstructured":"Corber\u00e1n A, Prins C (2010) Recent results on arc routing problems: an annotated bibliography. Networks 56:50\u201369","journal-title":"Networks"},{"key":"639_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/trsc.1120.0449","volume":"48","author":"JF Cordeau","year":"2014","unstructured":"Cordeau JF, Ghiani G, Guerriero E (2014) Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Transp Sci 48:46\u201358","journal-title":"Transp Sci"},{"key":"639_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/trsc.2017.0783","volume":"52","author":"E Fern\u00e1ndez","year":"2018","unstructured":"Fern\u00e1ndez E, Laporte G, Rodr\u00edguez-Pereira J (2018) A branch-and-cut algorithm for the multidepot rural postman problem. Transp Sci 52:353\u2013369","journal-title":"Transp Sci"},{"key":"639_CR12","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:160\u2013173","journal-title":"Transp Sci"},{"key":"639_CR13","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"},{"key":"639_CR14","first-page":"237","volume":"1","author":"M Guan","year":"1962","unstructured":"Guan M (1962) Graphic programming using odd and even points. Chinese Math. 1:237\u2013277","journal-title":"Chinese Math."},{"key":"639_CR15","unstructured":"Gurobi (2018) Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"key":"639_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim AH, Ismail I (2019) Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch Comput Methods Eng 26:367\u2013380","journal-title":"Arch Comput Methods Eng"},{"key":"639_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen P, Mladenovi\u0107 N, Todosijevi\u0107 R, Hanafi S (2017) Variable neighborhood search: basics and variants. EURO J Comput Optim 5:423\u2013454","journal-title":"EURO J Comput Optim"},{"key":"639_CR18","first-page":"80","volume":"36","author":"ME Horn","year":"2000","unstructured":"Horn ME (2000) Efficient modeling of travel in networks with time-varying link speeds. Networks Int J 36:80\u201390","journal-title":"Networks Int J"},{"key":"639_CR19","doi-asserted-by":"crossref","unstructured":"Huang T, Gong YJ, Kwong S, Wang H, Zhang J (2019) A niching memetic algorithm for multi-solution traveling salesman problem. IEEE Trans Evol Comput","DOI":"10.1109\/TEVC.2019.2936440"},{"key":"639_CR20","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, Van Woensel T, Gross JP (2017) Time-dependent vehicle routing problem with path flexibility. Trans Res Part B Methodol 95:169\u2013195","journal-title":"Trans Res Part B Methodol"},{"key":"639_CR21","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 JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144:379\u2013396","journal-title":"Eur J Oper Res"},{"key":"639_CR22","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\u201311","journal-title":"J Intell Transp Syst"},{"key":"639_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52156-5","volume-title":"Genetic algorithm essentials","author":"O Kramer","year":"2017","unstructured":"Kramer O (2017) Genetic algorithm essentials. Springer, Berlin"},{"key":"639_CR24","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.trb.2014.05.005","volume":"67","author":"L Meng","year":"2014","unstructured":"Meng L, Zhou X (2014) Simultaneous train rerouting and rescheduling on an n-track network: a model reformulation with network-based cumulative flow variables. Trans Res Part B Methodol 67:208\u2013234","journal-title":"Trans Res Part B Methodol"},{"key":"639_CR25","doi-asserted-by":"crossref","unstructured":"Mourao MC, Pinto LS (2017) An updated annotated bibliography on arc routing problems. Networks 70:144\u2013194","DOI":"10.1002\/net.21762"},{"key":"639_CR26","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1016\/j.ejor.2016.09.010","volume":"258","author":"J Nossack","year":"2017","unstructured":"Nossack J, Golden B, Pesch E, Zhang R (2017) The windy rural postman problem with a time-dependent zigzag option. Eur J Oper Res 258:1131\u20131142","journal-title":"Eur J Oper Res"},{"key":"639_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C Orloff","year":"1974","unstructured":"Orloff C (1974) A fundamental problem in vehicle routing. Networks 4:35\u201364","journal-title":"Networks"},{"key":"639_CR28","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.21759","volume":"70","author":"O Quirion-Blais","year":"2017","unstructured":"Quirion-Blais O, Langevin A, Lehu\u00e9d\u00e9 F, P\u00e9ton O, Tr\u00e9panier M (2017) Solving the large-scale min-max k-rural postman problem for snow plowing. Networks 70:195\u2013215","journal-title":"Networks"},{"key":"639_CR29","doi-asserted-by":"publisher","unstructured":"Rabbouch B, Sa\u00e2daoui F, Mraihi R (2019) Efficient implementation of the genetic algorithm to solve rich vehicle routing problems. Oper Res, pp 1\u201329. https:\/\/doi.org\/10.1007\/s12351-019-00521-0","DOI":"10.1007\/s12351-019-00521-0"},{"key":"639_CR30","first-page":"59","volume":"20","author":"M Shakibayifar","year":"2020","unstructured":"Shakibayifar M, Sheikholeslami A, Corman F, Hassannayebi E (2020) An integrated rescheduling model for minimizing train delays in the case of line blockage. Oper Res 20:59\u201387","journal-title":"Oper Res"},{"key":"639_CR31","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00158-010-0575-x","volume":"43","author":"D Sharma","year":"2011","unstructured":"Sharma D, Deb K, Kishore N (2011) Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm. Struct Multidiscip Optim 43:541\u2013554","journal-title":"Struct Multidiscip Optim"},{"key":"639_CR32","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10878-014-9755-8","volume":"29","author":"J Sun","year":"2015","unstructured":"Sun J, Meng Y, Tan G (2015) An integer programming approach for the Chinese postman problem with time-dependent travel time. J Combin Optim 29:565\u2013588","journal-title":"J Combin Optim"},{"key":"639_CR33","first-page":"410","volume":"5","author":"J Sun","year":"2011","unstructured":"Sun J, Tan G, Hou G (2011a) A new integer programming formulation for the chinese postman problem with time dependent travel times. World Academy of Science, Engineering and Technology. Int J Comput Electrical Autom Control Inf Eng 5:410\u2013414","journal-title":"Int J Comput Electrical Autom Control Inf Eng"},{"key":"639_CR34","first-page":"833","volume":"8","author":"J Sun","year":"2011","unstructured":"Sun J, Tan G, Qu H (2011b) Dynamic programming algorithm for the time dependent Chinese postman problem. J Inf Comput Sci 8:833\u2013841","journal-title":"J Inf Comput Sci"},{"key":"639_CR35","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0377-2217(99)00035-1","volume":"121","author":"K Sung","year":"2000","unstructured":"Sung K, Bell MG, Seong M, Park S (2000) Shortest paths in a network with time-dependent flow speeds. Eur J Oper Res 121:32\u201339","journal-title":"Eur J Oper Res"},{"key":"639_CR36","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ejor.2006.06.028","volume":"181","author":"M Tagmouti","year":"2007","unstructured":"Tagmouti M, Gendreau M, Potvin JY (2007) Arc routing problems with time-dependent service costs. Eur J Oper Res 181:30\u201339","journal-title":"Eur J Oper Res"},{"key":"639_CR37","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.cie.2010.09.006","volume":"59","author":"M Tagmouti","year":"2010","unstructured":"Tagmouti M, Gendreau M, Potvin JY (2010) A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Comput Ind Eng 59:954\u2013963","journal-title":"Comput Ind Eng"},{"key":"639_CR38","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.trc.2010.02.003","volume":"19","author":"M Tagmouti","year":"2011","unstructured":"Tagmouti M, Gendreau M, Potvin JY (2011) A dynamic capacitated arc routing problem with time-dependent service costs. Transp Res Part C Emerg Technol 19:20\u201328","journal-title":"Transp Res Part C Emerg Technol"},{"key":"639_CR39","doi-asserted-by":"crossref","unstructured":"Tan G, Sun J (2011) An integer programming approach for the rural postman problem with time dependent travel times. In: International Computing and Combinatorics Conference. Springer, pp 414\u2013431","DOI":"10.1007\/978-3-642-22685-4_37"},{"key":"639_CR40","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1080\/10556788.2012.666240","volume":"28","author":"G Tan","year":"2013","unstructured":"Tan G, Sun J, Hou G (2013) The time-dependent rural postman problem: polyhedral results. Optim Methods Softw 28:855\u2013870","journal-title":"Optim Methods Softw"},{"key":"639_CR41","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2015.09.001","volume":"90","author":"FY Vincent","year":"2015","unstructured":"Vincent FY, Lin SW (2015) Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem. Comput Ind Eng 90:54\u201366","journal-title":"Comput Ind Eng"},{"key":"639_CR42","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0898-1221(02)00156-6","volume":"44","author":"HF Wang","year":"2002","unstructured":"Wang HF, Wen YP (2002) Time-constrained Chinese postman problems. Comput Math Appl 44:375\u2013387","journal-title":"Comput Math Appl"},{"key":"639_CR43","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.trb.2013.10.012","volume":"59","author":"L Yang","year":"2014","unstructured":"Yang L, Zhou X (2014) Constraint reformulation and a lagrangian relaxation-based solution algorithm for a least expected time path problem. Transp Res Part B Methodol 59:22\u201344","journal-title":"Transp Res Part B Methodol"},{"key":"639_CR44","unstructured":"Yu B (2020) Data set of time-dependent rpp. https:\/\/github.com\/momoyby\/TDRPP"},{"key":"639_CR45","first-page":"1033","volume":"19","author":"G Yu","year":"2019","unstructured":"Yu G, Yang Y (2019) Dynamic routing with real-time traffic information. Oper Res 19:1033\u20131058","journal-title":"Oper Res"},{"key":"639_CR46","unstructured":"Zanotti R, Mansini R, Ghiani G, Guerriero E (2019) A kernel search approach for the time-dependent rural postman problem. In: WARP3 Proceedings, Pizzo, Italy"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00639-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00639-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00639-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T03:19:25Z","timestamp":1724987965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00639-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,3]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["639"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00639-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2021,5,3]]},"assertion":[{"value":"10 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}