Und›rected Ch›nese Postman Problem: An Appl›cat›on On Patrol Cars

Arc routing problem being one of the well known problems in combinatorial optimization is handled in this paper. The Chinese postman problem which is an arc routing problem, has many applications in real life problems such as mail delivery, road maintenance, routing of patrol cars and snow ploughs and bus scheduling. In this paper; after the explanation of basic concepts of Chinese postman problem, information about the types of Chinese postman problem is given. Then the solution methods for the undirected Chinese postman problem are examined and one of the solution methods, minimum length-matching method, is applied to the routing of a patrol car.