City services requiring the routing of vehicles which must cover every street in a complex highway network are investigated. An overview of the problems arising in planning such services as trash collection, snow plowing, and street cleaning, as well as the formulation of the general theoretical problem, known in literature as the Chinese postman problem, are presented. A fairly complete analysis is made of the trash collection and snow plowing problems for the city of Cambridge, MA, and differences between the real world problems and the theoretical mold are explored. A brief description of several existing algorithms to solve vehicle routing problems is given. A literature review and description of available methods is presented. A sample routing problem for the city of Cambridge is worked using an algorithm.