Show simple item record

dc.contributor.authorakarcay, ozlem
dc.contributor.authoryasar, esra
dc.date.accessioned2019-07-10T12:59:40Z
dc.date.available2019-07-10T12:59:40Z
dc.date.issued2018-05
dc.identifier.urihttps://hdl.handle.net/20.500.12498/1149
dc.description.abstractChinese Postman Problem which is dealt with in the context of the arc routing problem is one of the routing problem in 1962 in order to get the shortest turn by passing at least once on every arc on the chart. It can be used in many stations such as determining vehicle routing, tours of police patrols and determining the routes of snow removal vehicles. In this study, after explaining the basic concepts related to Chinese Postman Problem, the analysis is done through the model to find the best route over the routes that police patrol cars in a certain area have to travel.en_US
dc.language.isoenen_US
dc.publisher3rd International Conference on Computational Mathematics and Engineering Science (CMES 2018)en_US
dc.titleDetermining Optimal Routing Solution of a Patrol Caren_US
dc.typeConference Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record