{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:24Z","timestamp":1740107844566,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. Given that the resulting integer programming model makes use of a big number of binary variables and given the extended time horizon considered, 30\u00a0days in our case, the problem is characterized by a high level of complexity. However, our developed heuristic is able to solve instances having up to 40 nodes, 520 arcs and 5 hierarchies, whereas a general-purpose solver like Gurobi was not able to provide solutions for instances having more than 10 nodes. While the collected results are very encouraging, we provide at the end of this paper a set of possible future extensions of this work.<\/jats:p>","DOI":"10.1007\/s00500-021-06213-2","type":"journal-article","created":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T03:02:23Z","timestamp":1635735743000},"page":"709-724","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the periodic hierarchical Chinese postman problem"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9381-123X","authenticated-orcid":false,"given":"Muhammed Emre","family":"Keskin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8750-2470","authenticated-orcid":false,"given":"Chefi","family":"Triki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,1]]},"reference":[{"issue":"2","key":"6213_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/03052158808941206","volume":"14","author":"AS Alfa","year":"1988","unstructured":"Alfa AS, Liu DQ (1988) Postman routing problem in a hierarchical network. Eng Optim 14(2):127\u2013138","journal-title":"Eng Optim"},{"issue":"1","key":"6213_CR101","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-018-3117-3","volume":"286","author":"N Al-Hinai","year":"2020","unstructured":"Al-Hinai N, Triki C (2020) A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice. Ann Oper Res 286(1):325\u2013350","journal-title":"Ann Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Batista GV, Scarpin CT, P\u00e9cora JE, Ruiz A (2019) A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves. Math Probl Eng 2019","key":"6213_CR2","DOI":"10.1155\/2019\/3201656"},{"key":"6213_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"EJ Beltrami","year":"1974","unstructured":"Beltrami EJ, Bodin LD (1974) Networks and vehicle routing for municipal waste collection. Networks 4:65\u201394","journal-title":"Networks"},{"issue":"3","key":"6213_CR4","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.ejor.2019.01.056","volume":"276","author":"E Benavent","year":"2019","unstructured":"Benavent E, Corber\u00e1n \u00c1, Lagan\u00e0 D, Vocaturo F (2019) The periodic rural postman problem with irregular services on mixed graphs. Eur J Oper Res 276(3):826\u2013839","journal-title":"Eur J Oper Res"},{"issue":"34","key":"6213_CR5","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0360-8352(98)00127-2","volume":"35","author":"D Bommisetty","year":"1998","unstructured":"Bommisetty D, Dessouky M, Jacobs L (1998) Scheduling collection of recyclable material at Northern Illinois University Campus using a two-phase algorithm. Comput Ind Eng 35(34):435\u2013438","journal-title":"Comput Ind Eng"},{"issue":"1","key":"6213_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0377-2217(02)00813-5","volume":"155","author":"EA Cabral","year":"2004","unstructured":"Cabral EA, Gendreau M, Ghiani G, Laporte G (2004) Solving the hierarchical chinese postman problem as a rural postman problem. Eur J Oper Res 155(1):44\u201350","journal-title":"Eur J Oper Res"},{"key":"6213_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/net.21527","volume":"63","author":"AM Campbell","year":"2014","unstructured":"Campbell AM, Wilson JH (2014) Forty years of periodic vehicle routing. Networks 63:2\u201315","journal-title":"Networks"},{"key":"6213_CR8","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/0305-0548(94)00031-3","volume":"22","author":"I-M Chao","year":"1995","unstructured":"Chao I-M, Golden BL, Wasil EA (1995) A new heuristic for the period traveling salesman problem. Comput Oper Res 22:553\u2013565","journal-title":"Comput Oper Res"},{"issue":"1","key":"6213_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2017.06.025","volume":"264","author":"Y Chen","year":"2018","unstructured":"Chen Y, Hao JK (2018) Two phased hybrid local search for the periodic capacitated arc routing problem. Eur J Oper Res 264(1):55\u201365","journal-title":"Eur J Oper Res"},{"issue":"5","key":"6213_CR10","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1051\/ro\/2019080","volume":"54","author":"B Chen","year":"2020","unstructured":"Chen B, Qu R, Bai R, Laesanklang W (2020) A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO-Oper Res 54(5):1467\u20131494","journal-title":"RAIRO-Oper Res"},{"key":"6213_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"Christofides N, Beasley JE (1984) The period routing problem. Networks 14:237\u2013256","journal-title":"Networks"},{"issue":"2","key":"6213_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10845-004-5892-8","volume":"16","author":"F Chu","year":"2005","unstructured":"Chu F, Labadi N, Prins C (2005) Heuristics for the periodic capacitated arc routing problem. J Intell Manuf 16(2):243\u2013251","journal-title":"J Intell Manuf"},{"issue":"2","key":"6213_CR13","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.ejor.2004.08.017","volume":"169","author":"F Chu","year":"2006","unstructured":"Chu F, Labadi N, Prins C (2006) A scatter search for the periodic capacitated arc routing problem. Eur J Oper Res 169(2):586\u2013605","journal-title":"Eur J Oper Res"},{"issue":"1","key":"6213_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10100-018-0598-8","volume":"28","author":"MK \u00c7odur","year":"2020","unstructured":"\u00c7odur MK, Y\u0131lmaz M (2020) A time-dependent hierarchical Chinese postman problem. CEJOR 28(1):337\u2013366","journal-title":"CEJOR"},{"key":"6213_CR15","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":"6213_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30:105\u2013119","journal-title":"Networks"},{"key":"6213_CR17","first-page":"36","volume":"15","author":"P Damodaran","year":"2008","unstructured":"Damodaran P, Krishnamurthi M, Srihari K (2008) Lower bounds for hierarchical Chinese postman problem. Int J Ind Eng 15:36\u201344","journal-title":"Int J Ind Eng"},{"key":"6213_CR18","first-page":"1","volume-title":"Handbook of metaheuristics","author":"D Delahaye","year":"2019","unstructured":"Delahaye D, Chaimatanan S, Mongeau M (2019) Simulated annealing: from basics to applications. Handbook of metaheuristics. Springer, Cham, pp 1\u201335"},{"issue":"2","key":"6213_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10479-014-1640-4","volume":"242","author":"A Diabat","year":"2016","unstructured":"Diabat A, Abdallah T, Le T (2016) A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods. Ann Oper Res 242(2):373\u2013398","journal-title":"Ann Oper Res"},{"issue":"1","key":"6213_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"volume-title":"Arc routing: theory, solutions and applications","year":"2000","unstructured":"Dror M (ed) (2000) Arc routing: theory, solutions and applications. Kluwer Academic Publishers, Norwell, Massachusetts","key":"6213_CR21"},{"key":"6213_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230170304","volume":"17","author":"M Dror","year":"1987","unstructured":"Dror M, Stern H, Trudeau P (1987) Postman tour on a graph with precedence relation on arcs. Networks 17:283\u2013294","journal-title":"Networks"},{"issue":"3","key":"6213_CR102","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17(3):449\u2013467","journal-title":"Can J Math"},{"issue":"2","key":"6213_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995a) Arc routing problems, part I: the Chinese postman problem. Oper Res 43(2):231\u2013242","journal-title":"Oper Res"},{"issue":"3","key":"6213_CR24","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995b) Arc routing problems, part II: The rural postman problem. Oper Res 43(3):399\u2013414","journal-title":"Oper Res"},{"issue":"4","key":"6213_CR25","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1287\/trsc.1050.0140","volume":"40","author":"P Francis","year":"2006","unstructured":"Francis P, Smilowitz K, Tzur M (2006) The period vehicle routing problem with service choice. Transp Sci 40(4):439\u2013454","journal-title":"Transp Sci"},{"issue":"4","key":"6213_CR26","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/net.21993","volume":"76","author":"GE Fr\u00f6hlich","year":"2020","unstructured":"Fr\u00f6hlich GE, Doerner KF, Gansterer M (2020) Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs. Networks 76(4):431\u2013450","journal-title":"Networks"},{"issue":"3","key":"6213_CR27","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G Ghiani","year":"2000","unstructured":"Ghiani G, Laporte G (2000) A branch-and-cut algorithm for the undirected rural postman problem. Math Program 87(3):467\u2013481","journal-title":"Math Program"},{"key":"6213_CR28","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0548(03)00213-2","volume":"32","author":"G Ghiani","year":"2005","unstructured":"Ghiani G, Musmanno R, Paletta G, Triki C (2005) A heuristic for the periodic rural postman problem. Comput Oper Res 32:219\u2013228","journal-title":"Comput Oper Res"},{"issue":"6","key":"6213_CR29","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1080\/10556780701550026","volume":"22","author":"G Ghiani","year":"2007","unstructured":"Ghiani G, Quaranta A, Triki C (2007) New policies for the dynamic traveling salesman problem. Optim Methods Softw 22(6):971\u2013983","journal-title":"Optim Methods Softw"},{"unstructured":"Gurobi optimizer 9.0 (2021) High-end libraries for math programming. http:\/\/www.gurobi.com\/. Accessed Mar 2021","key":"6213_CR30"},{"issue":"7","key":"6213_CR31","first-page":"441","volume":"31","author":"SH Huang","year":"2014","unstructured":"Huang SH, Lin TH (2014) Using ant colony optimization to solve periodic arc routing problem with refill points. J Ind Prod Eng 31(7):441\u2013451","journal-title":"J Ind Prod Eng"},{"issue":"1","key":"6213_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10479-019-03430-9","volume":"296","author":"F Kaveh","year":"2021","unstructured":"Kaveh F, Tavakkoli-Moghaddam R, Triki C, Rahimi Y, Jamili A (2021) A new bi-objective model of the urban public transportation hub network design under uncertainty. Ann Oper Res 296(1):131\u2013162","journal-title":"Ann Oper Res"},{"unstructured":"Keskin ME, Y\u0131lmaz M, Triki C (2021) Solving the hierarchical windy postman problem with variable service costs using a math-heuristic algorithm.\u00a0Submitted for publication","key":"6213_CR33"},{"issue":"16","key":"6213_CR34","doi-asserted-by":"publisher","first-page":"7359","DOI":"10.1007\/s00500-018-3382-8","volume":"23","author":"ME Keskin","year":"2019","unstructured":"Keskin ME, Y\u0131lmaz M (2019) Chinese and windy postman problem with variable service costs. Soft Comput 23(16):7359\u20137373","journal-title":"Soft Comput"},{"issue":"1","key":"6213_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2004.06.003","volume":"169","author":"P Korteweg","year":"2006","unstructured":"Korteweg P, Volgenant T (2006) On the hierarchical Chinese postman problem with linear ordered classes. Eur J Oper Res 169(1):41\u201352","journal-title":"Eur J Oper Res"},{"issue":"2","key":"6213_CR36","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","volume":"165","author":"P Lacomme","year":"2005","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2005) Evolutionary algorithms for periodic arc routing problems. Eur J Oper Res 165(2):535\u2013553","journal-title":"Eur J Oper Res"},{"unstructured":"Leggieri V, Haouari M, Layeb S, Triki C (2007) The steiner tree problem with delays: a tight compact formulation and reduction procedures. Technical report, University of Salento, Lecce","key":"6213_CR37"},{"key":"6213_CR38","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2010.05.029","volume":"36","author":"V Leggieri","year":"2010","unstructured":"Leggieri V, Mohamed H, Chefi T (2010) An exact algorithm for the Steiner tree problem with delays. Electron Notes Discrete Math 36:223\u2013230","journal-title":"Electron Notes Discrete Math"},{"unstructured":"Liu DQ (1988) Snow clearing vehicle routing: the postman problem in a hierarchical network. MSc. Thesis, University of Manitoba","key":"6213_CR39"},{"issue":"6","key":"6213_CR40","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/TSMCB.2011.2158307","volume":"41","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011) A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern Part B Cybern 41(6):1654\u20131667","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"4\u20135","key":"6213_CR41","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.dam.2011.05.014","volume":"161","author":"IM Monroy","year":"2013","unstructured":"Monroy IM, Amaya CA, Langevin A (2013) The periodic capacitated arc routing problem with irregular services. Discrete Appl Math 161(4\u20135):691\u2013701","journal-title":"Discrete Appl Math"},{"issue":"03","key":"6213_CR42","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TLA.2020.9082729","volume":"18","author":"JD Oliveira","year":"2020","unstructured":"Oliveira JD, Scarpin CT (2020) A relax-and-fix decomposition strategy based on adjacent nodes applied to the periodic capacitated arc routing problem (PCARP). IEEE Lat Am Trans 18(03):573\u2013580","journal-title":"IEEE Lat Am Trans"},{"key":"6213_CR43","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/0305-0548(92)90018-Z","volume":"19","author":"G Paletta","year":"1992","unstructured":"Paletta G (1992) A multiperiod traveling salesman problem: heuristic algorithms. Comput Oper Res 19:789\u2013795","journal-title":"Comput Oper Res"},{"issue":"1","key":"6213_CR44","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/net.20011","volume":"44","author":"G Paletta","year":"2002","unstructured":"Paletta G, Triki C (2002) Solving the asymmetric traveling salesman problem with periodic constraints. Networks 44(1):31\u201337","journal-title":"Networks"},{"issue":"1","key":"6213_CR45","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/trsc.1070.0195","volume":"42","author":"N Perrier","year":"2008","unstructured":"Perrier N, Langevin A, Amaya CA (2008) Vehicle routing for urban snow plowing operations. Transp Sci 42(1):44\u201356","journal-title":"Transp Sci"},{"key":"6213_CR46","volume-title":"Modern heuristic techniques for combinatorial problems","author":"CR Reeves","year":"1993","unstructured":"Reeves CR (1993) Modern heuristic techniques for combinatorial problems. Wiley, New Jersey"},{"issue":"12","key":"6213_CR47","doi-asserted-by":"publisher","first-page":"1840","DOI":"10.1057\/jors.2013.159","volume":"65","author":"JP Riquelme-Rodr\u00edguez","year":"2014","unstructured":"Riquelme-Rodr\u00edguez JP, Gamache M, Langevin A (2014a) Periodic capacitated arc-routing problem with inventory constraints. J Oper Res Soc 65(12):1840\u20131852","journal-title":"J Oper Res Soc"},{"issue":"2","key":"6213_CR48","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.21562","volume":"64","author":"JP Riquelme-Rodr\u00edguez","year":"2014","unstructured":"Riquelme-Rodr\u00edguez JP, Langevin A, Gamache M (2014b) Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. Networks 64(2):125\u2013139","journal-title":"Networks"},{"key":"6213_CR49","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2016.06.012","volume":"76","author":"JP Riquelme-Rodr\u00edguez","year":"2016","unstructured":"Riquelme-Rodr\u00edguez JP, Gamache M, Langevin A (2016) Location arc routing problem with inventory constraints. Comput Oper Res 76:84\u201394","journal-title":"Comput Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Sayata UB, Desai NP (2015) An algorithm for hierarchical Chinese postman problem using minimum spanning tree approach based on Kruskals\u2019s algorithm. In: Souvenir of the 2015 IEEE international advance computing conference, IACC 7154702. pp 222\u2013227","key":"6213_CR50","DOI":"10.1109\/IADCC.2015.7154702"},{"issue":"2","key":"6213_CR51","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.ejor.2019.07.035","volume":"280","author":"M Shahmanzari","year":"2020","unstructured":"Shahmanzari M, Aksen D, Salhi S (2020) Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics. Eur J Oper Res 280(2):656\u2013670","journal-title":"Eur J Oper Res"},{"key":"6213_CR52","doi-asserted-by":"publisher","first-page":"104966","DOI":"10.1016\/j.cor.2020.104966","volume":"120","author":"M Taslimi","year":"2020","unstructured":"Taslimi M, Batta R, Kwon C (2020) Medical waste collection considering transportation and storage risk. Comput Oper Res 120:104966","journal-title":"Comput Oper Res"},{"issue":"10","key":"6213_CR53","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1109\/TLA.2018.8795136","volume":"16","author":"DV Thomaz","year":"2018","unstructured":"Thomaz DV, Loch GV, Scarpin CT, Schenekemberg CM (2018) A mathematical model for the periodic capacitated arc routing problem with time windows. IEEE Lat Am Trans 16(10):2567\u20132573","journal-title":"IEEE Lat Am Trans"},{"key":"6213_CR54","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.wasman.2018.03.015","volume":"76","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Mahdavi I, Esfahani MMS (2018) A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew\u2019s working time. Waste Manag 76:138\u2013146","journal-title":"Waste Manag"},{"issue":"11","key":"6213_CR55","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":"2","key":"6213_CR56","first-page":"69","volume":"10","author":"C Triki","year":"2013","unstructured":"Triki C (2013) Solution methods for the periodic petrol station replenishment problem. J Eng Res 10(2):69\u201377","journal-title":"J Eng Res"},{"issue":"03","key":"6213_CR57","doi-asserted-by":"publisher","first-page":"1740015","DOI":"10.1142\/S0217595917400152","volume":"34","author":"C Triki","year":"2017","unstructured":"Triki C (2017) Solving the periodic edge routing problem in the municipal waste collection. Asia-Pacific J Oper Res 34(03):1740015","journal-title":"Asia-Pacific J Oper Res"},{"issue":"2","key":"6213_CR58","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1504\/IJOR.2017.081478","volume":"28","author":"C Triki","year":"2017","unstructured":"Triki C, Akil J, Al-Azri N (2017) Optimising the periodic distribution of gas cylinders with customers priority. Int J Oper Res 28(2):279\u2013289","journal-title":"Int J Oper Res"},{"issue":"1","key":"6213_CR59","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/net.21942","volume":"77","author":"X Wang","year":"2020","unstructured":"Wang X, Wasil E (2020) On the road to better routes: Five decades of published research on the vehicle routing problem. Networks 77(1):66\u201387","journal-title":"Networks"},{"key":"6213_CR60","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer programming, vol 42. Wiley, New York"},{"key":"6213_CR61","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1016\/j.asoc.2016.09.017","volume":"52","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Mei Y, Tang K, Jiang K (2017) Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Appl Soft Comput 52:1130\u20131142","journal-title":"Appl Soft Comput"},{"issue":"3","key":"6213_CR62","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.3390\/su12031131","volume":"12","author":"W Zhou","year":"2020","unstructured":"Zhou W, You X, Fan W (2020) A mixed integer linear programming method for simultaneous multi-periodic train timetabling and routing on a high-speed rail network. Sustainability 12(3):1131","journal-title":"Sustainability"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06213-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06213-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06213-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:56:44Z","timestamp":1726030604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06213-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["6213"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06213-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,11,1]]},"assertion":[{"value":"24 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2021","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 of this research certify that there is no any affiliation with or involvement in any organization or entity with financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}