{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T22:01:31Z","timestamp":1763676091992,"version":"3.45.0"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.cor.2025.107327","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T02:48:55Z","timestamp":1762829335000},"page":"107327","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Time-dependent Windy Rural Postman Problem: Mathematical formulation and adaptive metaheuristic"],"prefix":"10.1016","volume":"186","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2086-7456","authenticated-orcid":false,"given":"Franklin A.","family":"Krukoski","sequence":"first","affiliation":[]},{"given":"Arinei C.L.","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Carise E.","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2025.107327_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2024.06.016","article-title":"A review of recent advances in time-dependent vehicle routing","volume":"319","author":"Adamo","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107327_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105446","article-title":"On path ranking in time-dependent graphs","volume":"135","author":"Adamo","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2025.107327_b3","doi-asserted-by":"crossref","first-page":"4660","DOI":"10.3390\/su12114660","article-title":"A survey of road traffic congestion measures towards a sustainable and resilient transportation system","volume":"12","author":"Afrin","year":"2020","journal-title":"Sustainability"},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b4","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1002\/net.21830","article-title":"A branch-and-bound algorithm for the time-dependent travelling salesman problem","volume":"72","author":"Arigliano","year":"2018","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b6","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ejor.2005.09.021","article-title":"Lower bounds and heuristics for the windy rural postman problem","volume":"176","author":"Benavent","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2022.09.026","article-title":"A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs","volume":"307","author":"Benavent","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2025.107327_b8","doi-asserted-by":"crossref","first-page":"3111","DOI":"10.1016\/j.cor.2004.04.007","article-title":"New heuristic algorithms for the windy rural postman problem","volume":"32","author":"Benavent","year":"2005","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b9","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","article-title":"A guided local search heuristic for the capacitated arc routing problem","volume":"147","author":"Beullens","year":"2003","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b10","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.cor.2012.08.001","article-title":"The time-dependent prize-collecting arc routing problem","volume":"40","author":"Black","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s11750-019-00514-4","article-title":"Perspectives on integer programming for time-dependent models","volume":"27","author":"Boland","year":"2019","journal-title":"TOP"},{"key":"10.1016\/j.cor.2025.107327_b12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.cor.2018.07.016","article-title":"A branch-and-bound algorithm for the time-dependent rural postman problem","volume":"102","author":"Calogiuri","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ejor.2020.10.035","article-title":"Solving the length constrained K-drones rural postman problem","volume":"292","author":"Campbell","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10589-022-00383-x","article-title":"Polyhedral analysis and a new algorithm for the length constrained K\u2013drones rural postman problem","volume":"83","author":"Campbell","year":"2022","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2025.107327_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114573","article-title":"A neural network approach for traffic prediction and routing with missing data imputation for intelligent transportation system","volume":"171","author":"Chan","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107327_b16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.cie.2018.07.031","article-title":"Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem","volume":"124","author":"Chaves","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/net.21965","article-title":"Arc routing problems: A review of the past, present, and future","volume":"77","author":"Corber\u00e1n","year":"2020","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/net.20176","article-title":"A branch & cut algorithm for the windy general routing problem and special cases","volume":"49","author":"Corber\u00e1n","year":"2007","journal-title":"Networks"},{"key":"10.1016\/j.cor.2025.107327_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106482","article-title":"Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem","volume":"162","author":"Corber\u00e1n","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20347","article-title":"Recent results on arc routing problems: An annotated bibliography","volume":"56","author":"Corber\u00e1n","year":"2010","journal-title":"Networks"},{"key":"10.1016\/j.cor.2025.107327_b21","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s00453-010-9461-6","article-title":"Shortest paths in time-dependent FIFO networks","volume":"62","author":"Dehne","year":"2010","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2025.107327_b22","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1016\/j.orl.2008.07.002","article-title":"Shortest paths in piecewise continuous time-dependent networks","volume":"36","author":"Dell\u2019Amico","year":"2008","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"10.1016\/j.cor.2025.107327_b23","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman problem","author":"Edmonds","year":"1973","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","article-title":"Arc routing problems, part I: The Chinese postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b25","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems, part II: The rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107327_b26","series-title":"Road Traffic Congestion: A Concise Guide","first-page":"93","article-title":"Measuring traffic congestion","volume":"vol. 7","author":"Falcocchio","year":"2015"},{"key":"10.1016\/j.cor.2025.107327_b27","series-title":"Arc Routing: Theory, Solutions and Applications","first-page":"19","article-title":"Traversing graphs: The Eulerian and Hamiltonian theme","author":"Fleischner","year":"2000"},{"key":"10.1016\/j.cor.2025.107327_b28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.cor.2015.06.001","article-title":"Time-dependent routing problems: A review","volume":"64","author":"Gendreau","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1590\/0101-7438.2014.034.02.0143","article-title":"An experimental comparison of biased and unbiased rankom-key genetic algorithms","volume":"34","author":"Gon\u00e7alves","year":"2014","journal-title":"Pesqui. Oper."},{"issue":"1\u20133","key":"10.1016\/j.cor.2025.107327_b30","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01581206","article-title":"A cutting plane algorithm for the windy postman problem","volume":"55","author":"Gr\u00f6tschel","year":"1992","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b31","first-page":"273","article-title":"Graphic programming using odd and even points","author":"Guan","year":"1962","journal-title":"Chin. Math"},{"issue":"2","key":"10.1016\/j.cor.2025.107327_b32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","article-title":"Vehicle dispatching with time-dependent travel times","volume":"144","author":"Ichoua","year":"2003","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107327_b33","first-page":"490","article-title":"The impact of time aggregation and travel time models on time-dependent routing solutions","volume":"61","author":"Jaballah","year":"2023","journal-title":"INFOR"},{"issue":"5","key":"10.1016\/j.cor.2025.107327_b34","doi-asserted-by":"crossref","first-page":"2692","DOI":"10.1109\/TITS.2020.2973806","article-title":"Planning of garbage collection service: An arc-routing problem with time-dependent penalty cost","volume":"22","author":"Jin","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"13","key":"10.1016\/j.cor.2025.107327_b35","doi-asserted-by":"crossref","first-page":"8789","DOI":"10.1007\/s00500-023-08032-z","article-title":"Solving the hierarchical windy postman problem with variable service costs using a math-heuristic algorithm","volume":"27","author":"Keskin","year":"2023","journal-title":"Soft Comput."},{"issue":"6","key":"10.1016\/j.cor.2025.107327_b36","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","article-title":"On general routing problems","author":"Lenstra","year":"1976","journal-title":"Networks"},{"key":"10.1016\/j.cor.2025.107327_b37","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cor.2017.07.007","article-title":"A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows","volume":"88","author":"Lum","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2025.107327_b38","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","article-title":"The Chinese postman problem for mixed networks","volume":"25","author":"Minieka","year":"1979","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b39","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/net.21762","article-title":"An updated annotated bibliography on arc routing problems","volume":"70","author":"Mour\u00e3o","year":"2017","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b40","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.ejor.2016.09.010","article-title":"The windy rural postman problem with a time-dependent zigzag option","volume":"258","author":"Nossack","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b41","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1590\/S0101-74382013000100007","article-title":"Clustering search","volume":"33","author":"Oliveira","year":"2013","journal-title":"Pesqui. Oper."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b42","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","article-title":"A fundamental problem in vehicle routing","volume":"4","author":"Orloff","year":"1974","journal-title":"Networks"},{"key":"10.1016\/j.cor.2025.107327_b43","series-title":"2015 IEEE International Conference on Industrial Engineering and Engineering Management","first-page":"863","article-title":"Survey on applications of biased-random key genetic algorithms for solving optimization problems","author":"Prasetyo","year":"2015"},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b44","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E"},{"issue":"May","key":"10.1016\/j.cor.2025.107327_b45","article-title":"A scatter search algorithm for time-dependent prize-collecting arc routing problems","volume":"134","author":"Riahi","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107327_b46","first-page":"429","article-title":"A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations \u2013 an application in city logistics","volume":"137","author":"Rincon-Garcia","year":"2020","journal-title":"Transp. Res. A"},{"key":"10.1016\/j.cor.2025.107327_b47","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.tre.2019.06.015","article-title":"The time-dependent location-routing problem","volume":"128","author":"Schmidt","year":"2019","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2025.107327_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2022.108653","article-title":"Time-dependent fleet size and mix multi-depot vehicle routing problem","volume":"255","author":"Schmidt","year":"2023","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b49","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.ejor.2016.08.032","article-title":"Trends in transportation and logistics","volume":"264","author":"Speranza","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b50","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10878-014-9755-8","article-title":"An integer programming approach for the Chinese postman problem with time-dependent travel time","volume":"29","author":"Sun","year":"2014","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.cor.2025.107327_b51","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2006.06.028","article-title":"Arc routing problems with time-dependent service costs","volume":"181","author":"Tagmouti","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107327_b52","series-title":"Computing and Combinatorics","first-page":"414","article-title":"An integer programming approach for the rural postman problem with time dependent travel times","author":"Tan","year":"2011"},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b53","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1287\/trsc.2020.1035","article-title":"Arc routing with time-dependent travel times and paths","volume":"55","author":"Vidal","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107327_b54","series-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","first-page":"967","article-title":"Efficient route planning on public transportation networks: A labelling approach","author":"Wang","year":"2015"},{"issue":"1\u20133","key":"10.1016\/j.cor.2025.107327_b55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01587080","article-title":"On the windy postman problem on eulerian graphs","volume":"44","author":"Win","year":"1989","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cor.2025.107327_b56","first-page":"2943","article-title":"Time-dependent rural postman problem: time-space network formulation and genetic algorithm","volume":"22","author":"Xin","year":"2021","journal-title":"Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003569?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003569?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T21:45:07Z","timestamp":1763675107000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825003569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":56,"alternative-id":["S0305054825003569"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107327","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Time-dependent Windy Rural Postman Problem: Mathematical formulation and adaptive metaheuristic","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107327","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107327"}}