{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T02:26:44Z","timestamp":1772850404149,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1016\/s0305-0548(03)00213-2","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:09:00Z","timestamp":1062601740000},"page":"219-228","source":"Crossref","is-referenced-by-count":18,"title":["A heuristic for the periodic rural postman problem"],"prefix":"10.1016","volume":"32","author":[{"given":"Gianpaolo","family":"Ghiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Musmanno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Paletta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chefi","family":"Triki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(03)00213-2_BIB1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1287\/opre.51.2.281.12790","article-title":"On the undirected rural postman problem: tight bounds based on a new formulation","volume":"51","author":"Fern\u00e1ndez","year":"2003","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(03)00213-2_BIB2","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"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/ijoc.11.1.53","article-title":"Improvement procedures for the undirected rural postman problem","volume":"11","author":"Hertz","year":"1999","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/S0305-0548(03)00213-2_BIB4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/inte.6.1pt2.32","article-title":"Analysis of solid waste management operations in Cleveland","volume":"6","author":"Clark","year":"1975","journal-title":"Interfaces"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB5","unstructured":"Negreiros M. O Problema de Planejamento e Percuso de Veculos na Coleta do Lixo Urbano Domiciliar. M.Sc. Dissertation, Sistemas\/COPPE, Federal University of Rio de Janeiro, Brazil, 1974."},{"key":"10.1016\/S0305-0548(03)00213-2_BIB6","first-page":"12","article-title":"IE's improve city's solid waste collection","volume":"46","author":"Wyskida","year":"1973","journal-title":"Industrial Engineering"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB7","unstructured":"Dror M, editors. Arc routing: theory, solutions and applications. New York: Kluwer Academic Publishers; 2002."},{"key":"10.1016\/S0305-0548(03)00213-2_BIB8","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":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB9","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":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","article-title":"The period routing problem","volume":"14","author":"Christofides","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A Tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/trsc.26.2.86","article-title":"A heuristic for the periodic vehicle routing problem","volume":"26","author":"Gaudioso","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB13","doi-asserted-by":"crossref","unstructured":"Paletta G. The period traveling salesman problem: a new heuristic algorithm. Computers and Operations Research, 2002, forthcoming.","DOI":"10.1016\/S0305-0548(01)00035-1"},{"key":"10.1016\/S0305-0548(03)00213-2_BIB14","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"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803002132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803002132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:22:35Z","timestamp":1551097355000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803002132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["S0305054803002132"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00213-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}