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

Gul Gokay Emel, Cagatan Task›n and Emtullah Dinc ()
Additional contact information
Emtullah Dinc: Uludag University

Anadolu University Journal of Social Sciences, 2003, vol. 3, issue 1, 121-140

Abstract: 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.

Keywords: Graph Theory; Arc Routing Problem; Chinese Postman Problem; Minimum- Length Matching; Patrol Cars. (search for similar items in EconPapers)
JEL-codes: C44 (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.anadolu.edu.tr/arastirma/hakemli_dergil ... 2003-1/sos_bil.6.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:and:journl:v:3:y:2003:i:1:p:121-140

Access Statistics for this article

Anadolu University Journal of Social Sciences is currently edited by Ramazan Geylan

More articles in Anadolu University Journal of Social Sciences from Anadolu University Contact information at EDIRC.
Bibliographic data for series maintained by Social Sciences Institute ( this e-mail address is bad, please contact ).