Determinação de roteiros ótimos em alguns serviços públicos.

Abstract

In this work a class of public service distribuition problems are considered in which the demand is distributed along the streets. Tipical problems of this class are: Garbage collection, postman problem etc. The principal effort is made in the determination of vehicle routes, to minimize total travel distance. The classic model of Chinese postman problem is used to solve this problem. In a computational experience, a real problem of garbage collection was solved. The comparison of obtained results and the existing solution demonstrates that the work could be applied to improve the service in practice.