Determining Optimal Routing Solution Of A Patrol Car

dc.contributor.author	AKARÇAY, Özlem
dc.contributor.author	YAŞAR, Esra
dc.date.accessioned	2019-07-10T13:02:08Z
dc.date.available	2019-07-10T13:02:08Z
dc.date.issued	2018-05-07
dc.identifier.uri	https://hdl.handle.net/20.500.12498/1151
dc.description.abstract	Chinese 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.
dc.language.iso	en	en_US
dc.publisher	3rd International Conference on Computational Mathematics and Engineering Science (CMES 2018)
dc.subject	Chinese Postman Problem	en_US
dc.subject	Optimization	en_US
dc.subject	Routing Problem	en_US
dc.title	Determining Optimal Routing Solution Of A Patrol Car	en_US
dc.type	Konferans Bildirisi	en_US