{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:59:02Z","timestamp":1763535542768,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00500-018-3382-8","type":"journal-article","created":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T01:17:26Z","timestamp":1531271846000},"page":"7359-7373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Chinese and windy postman problem with variable service costs"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9381-123X","authenticated-orcid":false,"given":"Muhammed Emre","family":"Keskin","sequence":"first","affiliation":[]},{"given":"Mustafa","family":"Y\u0131lmaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"3382_CR1","first-page":"375","volume":"8","author":"AA Assad","year":"1995","unstructured":"Assad AA, Golden BL (1995) Arc routing methods and applications. Handb Oper Res Manag Sci 8:375\u2013483","journal-title":"Handb Oper Res Manag Sci"},{"issue":"3","key":"3382_CR2","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.ejor.2015.10.016","volume":"249","author":"T \u00c1vila","year":"2016","unstructured":"\u00c1vila T, Corber\u00e1n \u00c1, Plana I, Sanchis JM (2016) A branch-and-cut algorithm for the profitable windy rural postman problem. Eur J Oper Res 249(3):1092\u20131101","journal-title":"Eur J Oper Res"},{"issue":"7","key":"3382_CR3","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E Benavent","year":"1992","unstructured":"Benavent E, Campos V, Corber\u00e1n A, Mota E (1992) The capacitated arc routing problem: lower bounds. Networks 22(7):669\u2013690","journal-title":"Networks"},{"issue":"2","key":"3382_CR4","doi-asserted-by":"crossref","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(2):526\u2013535","journal-title":"Comput Oper Res"},{"key":"3382_CR5","unstructured":"Campbell JF, Langevin A (2000) Roadway snow and ice control. In: Dror M (ed) Arc routing. Springer, Berlin, pp 389\u2013418"},{"issue":"1","key":"3382_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/trsc.1120.0449","volume":"48","author":"JF Cordeau","year":"2012","unstructured":"Cordeau JF, 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":"3382_CR7","doi-asserted-by":"crossref","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"},{"key":"3382_CR8","volume-title":"Arc routing: theory, solutions and applications","author":"M Dror","year":"2012","unstructured":"Dror M (2012) Arc routing: theory, solutions and applications. Springer, Dordrecht"},{"issue":"4","key":"3382_CR9","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.cor.2012.10.013","volume":"40","author":"B Dussault","year":"2013","unstructured":"Dussault B, Golden B, Gro\u00ebr C, Wasil E (2013) Plowing with precedence: a variant of the windy postman problem. Comput Oper Res 40(4):1047\u20131059","journal-title":"Comput Oper Res"},{"issue":"11","key":"3382_CR10","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1057\/jors.1992.160","volume":"43","author":"R Eglese","year":"1992","unstructured":"Eglese R, Li L (1992) Efficient routeing for winter gritting. J Oper Res Soc 43(11):1031\u20131034","journal-title":"J Oper Res Soc"},{"key":"3382_CR11","doi-asserted-by":"crossref","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":"1","key":"3382_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47\u201359","journal-title":"Comput Oper Res"},{"issue":"1","key":"3382_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(84)90089-1","volume":"9","author":"M Guan","year":"1984","unstructured":"Guan M (1984) On the windy postman problem. Discrete Appl Math 9(1):41\u201346","journal-title":"Discrete Appl Math"},{"key":"3382_CR14","unstructured":"Gurobi optimizer 6.0.: high-end libraries for math programming (2017). \n                    http:\/\/www.gurobi.com\/\n                    \n                  . Accessed Jan 2017"},{"key":"3382_CR15","doi-asserted-by":"crossref","unstructured":"Hertz A (2005) Recent trends in arc routing. In: Golumbic MC, Hartman IBA (eds) Graph theory, combinatorics and algorithms. Springer, Berlin, pp 215\u2013236","DOI":"10.1007\/0-387-25036-0_9"},{"issue":"2","key":"3382_CR16","doi-asserted-by":"crossref","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(2):379\u2013396","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3382_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur J Oper Res 249(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3382_CR18","first-page":"217","volume":"47","author":"LY Li","year":"1996","unstructured":"Li LY, Eglese RW (1996) An interactive algorithm for vehicle routeing for winter-gritting. J Oper Res Soc 47(2):217\u2013228","journal-title":"J Oper Res Soc"},{"key":"3382_CR19","doi-asserted-by":"crossref","unstructured":"Li F, Golden B, Wasil E (2005) Solving the time dependent traveling salesman problem. In: Golden B, Raghavan S (eds) The next wave in computing, optimization, and decision technologies. Springer, Berlin, pp 163\u2013182","DOI":"10.1007\/0-387-23529-9_12"},{"issue":"3","key":"3382_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185\u2013200","journal-title":"Transp Sci"},{"issue":"1","key":"3382_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur J Oper Res 90(1):45\u201355","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3382_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0378-4371(02)01078-6","volume":"314","author":"J Schneider","year":"2002","unstructured":"Schneider J (2002) The time-dependent traveling salesman problem. Phys A Stat Mech Appl 314(1):151\u2013155","journal-title":"Phys A Stat Mech Appl"},{"key":"3382_CR23","doi-asserted-by":"crossref","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:37\u201345","journal-title":"J Manuf Syst"},{"issue":"3","key":"3382_CR24","doi-asserted-by":"crossref","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 Comb Optim 29(3):565\u2013588","journal-title":"J Comb Optim"},{"issue":"1","key":"3382_CR25","doi-asserted-by":"crossref","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(1):30\u201339","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3382_CR26","doi-asserted-by":"crossref","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(4):954\u2013963","journal-title":"Comput Ind Eng"},{"issue":"1","key":"3382_CR27","doi-asserted-by":"crossref","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(1):20\u201328","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"2","key":"3382_CR28","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.ejor.2015.07.048","volume":"248","author":"D Ta\u015f","year":"2016","unstructured":"Ta\u015f D, Gendreau M, Jabali O, Laporte G (2016) The traveling salesman problem with time-dependent service times. Eur J Oper Res 248(2):372\u2013383","journal-title":"Eur J Oper Res"},{"key":"3382_CR29","unstructured":"Test instances for arc routing problems. \n                    http:\/\/www.uv.es\/corberan\/instancias.htm\n                    \n                   (2017). Accessed Jan 2017"},{"key":"3382_CR30","doi-asserted-by":"crossref","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"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3382-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T19:04:14Z","timestamp":1562785454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3382-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":30,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["3382"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3382-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"11 July 2018","order":1,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}