{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T10:30:11Z","timestamp":1723199411843},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100008530","name":"Fondo Europeo de Desarrollo Regional","doi-asserted-by":"publisher","award":["MTM2015-68097-P"],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.ejor.2019.01.056","type":"journal-article","created":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T17:08:26Z","timestamp":1548868106000},"page":"826-839","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["The periodic rural postman problem with irregular services on mixed graphs"],"prefix":"10.1016","volume":"276","author":[{"given":"Enrique","family":"Benavent","sequence":"first","affiliation":[]},{"given":"\u00c1ngel","family":"Corber\u00e1n","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2618-6715","authenticated-orcid":false,"given":"Demetrio","family":"Lagan\u00e0","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Vocaturo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejor.2019.01.056_bib0001","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1016\/j.ejor.2016.08.001","article-title":"The undirected capacitated general routing problem with profits","volume":"257","author":"Archetti","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.056_bib0002","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cor.2015.08.003","article-title":"A branch-and-cut algorithm for the orienteering arc routing problem","volume":"66","author":"Archetti","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0003","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(86)90063-8","article-title":"On the cycle polytope of a binary matroid","volume":"40","author":"Barahona","year":"1986","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0004","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1018316919294","article-title":"The capacitated arc routing problem: Valid inequalities and facets","volume":"10","author":"Belenguer","year":"1998","journal-title":"Computational Optimization and Applications"},{"issue":"12","key":"10.1016\/j.ejor.2019.01.056_bib0005","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","article-title":"Lower and upper bounds for the mixed capacitated arc routing problem","volume":"33","author":"Belenguer","year":"2006","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0006","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/trsc.2014.0571","article-title":"A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots","volume":"50","author":"Belenguer","year":"2016","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0007","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipal waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.056_bib0008","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20334","article-title":"Min-max k-vehicles windy rural postman problem","volume":"54","author":"Benavent","year":"2009","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.056_bib0009","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.20469","article-title":"New facets and an enhanced branch-and-cut for the min-max k-vehicles windy rural postman problem","volume":"58","author":"Benavent","year":"2011","journal-title":"Networks"},{"issue":"7","key":"10.1016\/j.ejor.2019.01.056_bib0010","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1007\/s11590-012-0552-y","article-title":"Modeling and solving the mixed capacitated general routing problem","volume":"7","author":"Bosco","year":"2013","journal-title":"Optimization Letters"},{"key":"10.1016\/j.ejor.2019.01.056_bib0011","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","article-title":"Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots","volume":"67","author":"Braekers","year":"2014","journal-title":"Transportation Research Part B"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0012","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1002\/net.21527","article-title":"Forty years of periodic vehicle routing","volume":"63","author":"Campbell","year":"2014","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.056_bib0013","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s11518-006-0174-y","article-title":"The periodic capacitated arc routing problem: Linear programming model, metaheuristic and lower bounds","volume":"13","author":"Chu","year":"2004","journal-title":"Journal of Systems Science and Systems Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0014","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10845-004-5892-8","article-title":"Heuristics for the periodic capacitated arc routing problem","volume":"16","author":"Chu","year":"2005","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0015","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.ejor.2004.08.017","article-title":"A scatter search for the periodic capacitated arc routing problem","volume":"169","author":"Chu","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0016","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.ejor.2017.11.039","article-title":"Branch-price-and-cut for the mixed capacitated general routing problem with time windows","volume":"267","author":"Ciancio","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.056_bib0017","series-title":"MOS-SIAM series on optimization","article-title":"Arc routing: Problems, methods and applications","author":"Corber\u00e1n","year":"2014"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0018","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/PL00011426","article-title":"A cutting plane algorithm for the general routing problem","volume":"90","author":"Corber\u00e1n","year":"2001","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2019.01.056_bib0019","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-011-0507-6","article-title":"A branch-and-cut algorithm for the maximum benefit chinese postman problem","volume":"141","author":"Corber\u00e1n","year":"2013","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0020","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","article-title":"A polyhedral approach to the rural postman problem","volume":"79","author":"Corber\u00e1n","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.056_bib0021","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.trb.2005.12.001","article-title":"Modeling techniques for periodic vehicle routing problems","volume":"40","author":"Francis","year":"2006","journal-title":"Transportation Research Part B"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.056_bib0022","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1050.0140","article-title":"The period vehicle routing problem with service choice","volume":"40","author":"Francis","year":"2006","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.056_bib0023","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s101070050007","article-title":"A branch-and-cut algorithm for the undirected rural postman problem","volume":"87","author":"Ghiani","year":"2000","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0024","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0548(03)00213-2","article-title":"A heuristic for the periodic rural postman problem","volume":"32","author":"Ghiani","year":"2005","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0025","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1111\/mice.12031","article-title":"A tabu search method for a bi-objective urban waste collection problem","volume":"30","author":"G\u00f3mez","year":"2015","journal-title":"Computer-Aided Civil and Infrastructure Engineering"},{"issue":"7","key":"10.1016\/j.ejor.2019.01.056_bib0026","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/21681015.2014.980444","article-title":"Using ant colony optimization to solve periodic arc routing problem with refill points","volume":"31","author":"Huang","year":"2014","journal-title":"Journal of Industrial and Production Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.056_bib0027","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.ejor.2014.11.005","article-title":"Two-phase branch-and-cut for the mixed capacitated general routing problem","volume":"243","author":"Irnich","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.056_bib0028","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","article-title":"Evolutionary algorithms for periodic arc routing problems","volume":"165","author":"Lacomme","year":"2005","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.ejor.2019.01.056_bib0029","doi-asserted-by":"crossref","first-page":"3494","DOI":"10.1016\/j.cor.2005.02.040","article-title":"Road network monitoring: Algorithms and a case study","volume":"33","author":"Marzolf","year":"2006","journal-title":"Computers & Operations Research"},{"issue":"4\u20135","key":"10.1016\/j.ejor.2019.01.056_bib0030","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.dam.2011.05.014","article-title":"The periodic capacitated arc routing problem with irregular services","volume":"161","author":"Monroy","year":"2013","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.056_bib0031","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":"1","key":"10.1016\/j.ejor.2019.01.056_bib0032","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 Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300918?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300918?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T05:46:09Z","timestamp":1569131169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["S0377221719300918"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.056","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The periodic rural postman problem with irregular services on mixed graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.056","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}