Source: http://bibliotekevirtual.org/index.php/2013-02-07-03-02-35/2013-02-07-03-03-11/175-ijie/v02n03/841-v02n03a07.html
Timestamp: 2019-04-25 19:50:19+00:00

Document:
Abstract: This paper introduces a methodology to obtain optimal routes for the collection of urban waste. The problem is characterized as arcs coverage and for its development a combination of techniques in the Operational Research area was used. Firstly, the Teitz and Bart heuristic was used to obtain p-medians; from the definition of latter were defined groups (clusters) of demand points by designating these to the medians, by means of the Gillett and Johnson algorithm, adapted. Finally, from the definition of the groups of points, the Chinese Postman Algorithm was used, resulting in the routing (sequencing the demand points to be served) in each of the service groups. The results obtained are presented for a case study of the city of Joinville, State of Santa Catarina.
BODIN, L.; GOLDEN, B.; ASSAD, A. E BALL, M. Routing and scheduling of vehicles and crews: the state of the art. England, Pergamon Press, v. 10, n. 2, 1983.
CARVALHO, L. E. X. Desenvolvimento de solução integrada de sistemas de limpeza urbana em ambientes SIG. Dissertação de Mestrado, UFRJ, 2001.
COSTA, D. M. B.; STEINER M. T. A.; CARNIERI C.; ZAMBONI L. V. S. E DA SILVA A. C. L. Técnicas da pesquisa operacional na otimização dos serviços postais, Gestão & Produção, v. 8, n. 1, p. 37-55, 2001.
DETOFENO, T. C.; STEINER, M. T. A. Otimização das rotas de coleta de resíduos urbanos: utilizando técnicas de pesquisa operacional, XXXII CNMAC, Cuiabá, MT, 2009.
EGLESE, R. W. E MURDOCK, H. Routing Road Sweepers in a Rural Area, JORS, v. 4, p. 281-288, 1991.
GHIANI, G. E IMPROTA, G. An Algorithm for the Hierarchical Chinese Postman Problem, JORS, v. 26, p. 27-32, 2000.
IBGE, INSTITUTO BRASILEIRO DE GEOGRAFIA E ESTATISTICA. Pesquisa Nacional de Saneamento Básico (PNSB), 2000.
STERN, H.I. E DROR, M. Routing Electric Meter Readers, Computers & Operations Research, v. 6, 209-223, 1978.
TEITZ, M. B.; BART, P. Heuristics Methods for Estimating the Generalized Vertex Median of a Weighted Graph, Operations Research, v. 16, p. 955-961, 1968.

References: v. 
 V. 
 v. 
 v. 
 v. 
 v. 
 v.