Determining Optimal Routing Solution Of A Patrol Car

AKARÇAY, Özlem; YAŞAR, Esra

Determining Optimal Routing Solution Of A Patrol Car

Yazar/lar AKARÇAY, Özlem
YAŞAR, Esra
Yayın Türü Konferans Bildirisi
Yayın Tarihi 2018
Yayıncı 3rd International Conference on Computational Mathematics and Engineering Science (CMES 2018)
Tek Biçim Adres https://hdl.handle.net/20.500.12498/1151
Konu Başlıkları Chinese Postman Problem
Optimization
Routing Problem

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.

Koleksiyonlar Fakülteler
Mühendislik ve Doğa Bilimleri Fakültesi
Endüstri Mühendisliği

Erişime Açık

Görüntülenme

58

22.03.2024 tarihinden bu yana

İndirme

1

22.03.2024 tarihinden bu yana

Son Erişim Tarihi

10 Aralık 2024 19:52

Google Kontrol

Tıklayınız

Tam Metin İndirmek için tıklayın Ön izleme

Eser Adı (dc.title)	Determining Optimal Routing Solution Of A Patrol Car
Yayın Türü (dc.type)	Konferans Bildirisi
Yazar/lar (dc.contributor.author)	AKARÇAY, Özlem
Yazar/lar (dc.contributor.author)	YAŞAR, Esra
Atıf Dizini (dc.source.database)	Diğer
Konu Başlıkları (dc.subject)	Chinese Postman Problem
Konu Başlıkları (dc.subject)	Optimization
Konu Başlıkları (dc.subject)	Routing Problem
Yayıncı (dc.publisher)	3rd International Conference on Computational Mathematics and Engineering Science (CMES 2018)
Yayın Tarihi (dc.date.issued)	2018
Kayıt Giriş Tarihi (dc.date.accessioned)	2019-07-10T13:02:08Z
Açık Erişim tarihi (dc.date.available)	2019-07-10T13:02:08Z
Özet (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.
Yayın Dili (dc.language.iso)	eng
Tek Biçim Adres (dc.identifier.uri)	https://hdl.handle.net/20.500.12498/1151

Yayın Görüntülenme

Erişilen ülkeler

Erişilen şehirler

Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.