{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T05:10:11Z","timestamp":1759036211261,"version":"3.44.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10878-025-01344-w","type":"journal-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T05:27:49Z","timestamp":1756531669000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Moving horizon capacitated arc routing problem"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5432-4516","authenticated-orcid":false,"given":"Somnath","family":"Buriuly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leena","family":"Vachhani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivapragasam","family":"Ravitharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunita","family":"Chauhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"issue":"1","key":"1344_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-011-0497-4","volume":"137","author":"E Bartolini","year":"2013","unstructured":"Bartolini E, Cordeau J-F, Laporte G (2013) Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math Program 137(1):409\u2013452. https:\/\/doi.org\/10.1007\/s10107-011-0497-4","journal-title":"Math Program"},{"issue":"8","key":"1344_CR2","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1057\/palgrave.jors.2601590","volume":"54","author":"M Blais","year":"2003","unstructured":"Blais M, Laporte G (2003) Exact solution of the generalized routing problem through graph transformations. J Oper Res Soc 54(8):906\u2013910","journal-title":"J Oper Res Soc"},{"key":"1344_CR3","doi-asserted-by":"publisher","unstructured":"Buriuly S, Vachhani L, Sinha A, Ravitharan S, Chauhan S (2022) Route planning for capacity restricted agents over railway network, without disrupting train schedules. IFAC-PapersOnLine 55(1) 38-45. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2405896322000076 7th International Conference on Advances in Control and Optimization of Dynamical Systems ACODS 2022 https:\/\/doi.org\/10.1016\/j.ifacol.2022.04.007","DOI":"10.1016\/j.ifacol.2022.04.007"},{"issue":"1","key":"1344_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10479-018-2988-7","volume":"271","author":"D Cattaruzza","year":"2018","unstructured":"Cattaruzza D, Absi N, Feillet D (2018) Vehicle routing problems with multiple trips. Ann Oper Res 271(1):127\u2013159","journal-title":"Ann Oper Res"},{"issue":"1","key":"1344_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Program 20(1):255\u2013282","journal-title":"Math Program"},{"key":"1344_CR6","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n \u00c1, Laporte G (2015) Arc routing: problems, methods, and applications. SIAM","DOI":"10.1137\/1.9781611973679"},{"issue":"1","key":"1344_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2021.04.024","volume":"296","author":"VL de Lima","year":"2022","unstructured":"de Lima VL, Alves C, Clautiaux F, Iori M, Val\u00e9rio de Carvalho JM (2022) Arc flow formulations based on dynamic programming: theoretical foundations and applications. Eur J Oper Res 296(1):3\u201321","journal-title":"Eur J Oper Res"},{"key":"1344_CR8","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation (Vol.\u00a05). Springer Science & Business Media","DOI":"10.1007\/b135457"},{"key":"1344_CR9","doi-asserted-by":"crossref","unstructured":"Dror M (2000) Arc routing theory, solutions and applications","DOI":"10.1007\/978-1-4615-4495-1"},{"issue":"11","key":"1344_CR10","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1057\/jors.1992.160","volume":"43","author":"RW Eglese","year":"1992","unstructured":"Eglese RW, Li LYO (1992) Efficient routeing for winter gritting. J Oper Res Soc 43(11):1031\u20131034. https:\/\/doi.org\/10.1057\/jors.1992.160","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1344_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","volume":"122","author":"G Ghiani","year":"2000","unstructured":"Ghiani G, Improta G (2000) An efficient transformation of the generalized vehicle routing problem. Eur J Oper Res 122(1):11\u201317","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1344_CR12","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.ejor.2012.06.017","volume":"223","author":"EE Halvorsen-Weare","year":"2012","unstructured":"Halvorsen-Weare EE, Fagerholt K, Non\u00e5s LM, Asbj\u00f8rnslett BE (2012) Optimal fleet composition and periodic routing of offshore supply vessels. Eur J Oper Res 223(2):508\u2013517","journal-title":"Eur J Oper Res"},{"key":"1344_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.trc.2016.05.006","volume":"68","author":"B Kersbergen","year":"2016","unstructured":"Kersbergen B, van den Boom T, De Schutter B (2016) Distributed model predictive control for railway traffic management. Transp Res Part C Emerg technol 68:462\u2013489","journal-title":"Transp Res Part C Emerg technol"},{"key":"1344_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.trb.2018.11.007","volume":"118","author":"S Kulkarni","year":"2018","unstructured":"Kulkarni S, Krishnamoorthy M, Ranade A, Ernst AT, Patil R (2018) A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem. Transp Res Part B Methodol 118:457\u2013487. https:\/\/doi.org\/10.1016\/j.trb.2018.11.007","journal-title":"Transp Res Part B Methodol"},{"key":"1344_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.trb.2018.09.001","volume":"117","author":"S Li","year":"2018","unstructured":"Li S, Zhou X, Yang L, Gao Z (2018) Automatic train regulation of complex metro networks with transfer coordination constraints: a distributed optimal control framework. Transp Res Part B Methodol 117:228\u2013253","journal-title":"Transp Res Part B Methodol"},{"key":"1344_CR16","doi-asserted-by":"publisher","unstructured":"Liu M, Singh HK, Ray T (2014) A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems. In 2014 ieee congress on evolutionary computation (cec) (p. 595-602). https:\/\/doi.org\/10.1109\/CEC.2014.6900358","DOI":"10.1109\/CEC.2014.6900358"},{"issue":"6","key":"1344_CR17","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0005-1098(99)00214-9","volume":"36","author":"D Mayne","year":"2000","unstructured":"Mayne D, Rawlings J, Rao C, Scokaert P (2000) Constrained model predictive control: stability and optimality. Automatica 36(6):789\u2013814. https:\/\/doi.org\/10.1016\/S0005-1098(99)00214-9","journal-title":"Automatica"},{"issue":"2","key":"1344_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/ijoc.1110.0495","volume":"25","author":"A Mingozzi","year":"2013","unstructured":"Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multitrip vehicle routing problem. INFORMS J Comput 25(2):193\u2013207","journal-title":"INFORMS J Comput"},{"issue":"4","key":"1344_CR19","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1287\/trsc.2021.1045","volume":"55","author":"M Morabit","year":"2021","unstructured":"Morabit M, Desaulniers G, Lodi A (2021) Machine-learning-based column selection for column generation. Transp Sci 55(4):815\u2013831","journal-title":"Transp Sci"},{"key":"1344_CR20","doi-asserted-by":"crossref","unstructured":"Ouaddi K, Mhada F-Z, Benadada Y (2020) A comparative study of three methods for solving the mutli-trip dynamic vehicle routing problem with overtime (mtdvrpot). In 2020 5th international conference on logistics operations management (gol) (pp. 1\u20138)","DOI":"10.1109\/GOL49479.2020.9314727"},{"issue":"6","key":"1344_CR21","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1287\/trsc.2019.0900","volume":"53","author":"D Pecin","year":"2019","unstructured":"Pecin D, Uchoa E (2019) Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm. Transp Sci 53(6):1673\u20131694. https:\/\/doi.org\/10.1287\/trsc.2019.0900","journal-title":"Transp Sci"},{"key":"1344_CR22","doi-asserted-by":"publisher","unstructured":"Polak E, Yang TH, Mayne DQ (1990) A method of centers based on barrier functions for solving optimal control problems with continuum state and control constraints. In 29th IEEE Conference on Decision and Control 29th IEEE Conference on Decision and Control (p. 2327-2332 vol.4). https:\/\/doi.org\/10.1109\/CDC.1990.204041","DOI":"10.1109\/CDC.1990.204041"},{"issue":"1","key":"1344_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67(1):3\u201331","journal-title":"Networks"},{"key":"1344_CR24","unstructured":"Results video for Moving Horizon Capacitated Arc Routing Problem (2022). https:\/\/youtu.be\/WcUA89B737U. See Section 6.3, Table 7"},{"issue":"1","key":"1344_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215\u2013231. https:\/\/doi.org\/10.1080\/00207543.2015.1043403","journal-title":"Int J Prod Res"},{"key":"1344_CR26","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.trc.2019.05.045","volume":"105","author":"Z Su","year":"2019","unstructured":"Su Z, Jamshidi A, N\u00fa\u00f1ez A, Baldi S, De Schutter B (2019) Integrated condition-based track maintenance planning and crew scheduling of railway networks. Transp Res Part C Emerg Technol 105:359\u2013384","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1344_CR27","unstructured":"Sugishita N, Grothey A, McKinnon K (2021) Warmstarting column generation for unit commitment. arXiv preprint arXiv:2110.06872"},{"issue":"1","key":"1344_CR28","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 J-Y (2011) A dynamic capacitated arc routing problem with time-dependent service costs. Transp Res Part C Emerg Technol 19(1):20\u201328. https:\/\/doi.org\/10.1016\/j.trc.2010.02.003","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1344_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.compeleceng.2018.01.040","volume":"77","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2019) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng 77:457\u2013470","journal-title":"Comput Electr Eng"},{"issue":"11","key":"1344_CR30","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1177\/0734242X19865340","volume":"37","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee EB, Goli A, Pahlevan M, Malekalipour Kordestanizadeh R (2019) A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste collection using a multi-objective invasive weed optimization. Waste Manag Res 37(11):1089\u20131101","journal-title":"Waste Manag Res"},{"issue":"5","key":"1344_CR31","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.3390\/su10051366","volume":"10","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Hosseinabadi AAR, Soltani M, Sangaiah AK, Wang J (2018) A hybrid genetic algorithm for multi-trip green capacitated arc routing problem in the scope of urban services. Sustainability 10(5):1366","journal-title":"Sustainability"},{"key":"1344_CR32","doi-asserted-by":"publisher","unstructured":"Tong H, Minku L, Menzel S, Sendhoff B, Yao X (2023) A novel generalized metaheuristic framework for dynamic capacitated arc routing problems. In Proceedings of the companion conference on genetic and evolutionary computation (p. 45\u201346). New York, NY, USAAssociation for Computing Machinery. https:\/\/doi.org\/10.1145\/3583133.3595829","DOI":"10.1145\/3583133.3595829"},{"key":"1344_CR33","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications. SIAM","DOI":"10.1137\/1.9781611973594"},{"issue":"8","key":"1344_CR34","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.automatica.2004.03.002","volume":"40","author":"AG Wills","year":"2004","unstructured":"Wills AG, Heath WP (2004) Barrier function based model predictive control. Automatica 40(8):1415\u20131422. https:\/\/doi.org\/10.1016\/j.automatica.2004.03.002","journal-title":"Automatica"},{"key":"1344_CR35","doi-asserted-by":"publisher","first-page":"151239","DOI":"10.1109\/ACCESS.2019.2948154","volume":"7","author":"J Zheng","year":"2019","unstructured":"Zheng J, Zhang Y (2019) A fuzzy receding horizon control strategy for dynamic vehicle routing problem. IEEE Access 7:151239\u2013151251","journal-title":"IEEE Access"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01344-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01344-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01344-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:55:15Z","timestamp":1759035315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01344-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1344"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01344-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"20 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"15"}}