A Successive algorithm for the chinese postman problem
| dc.contributor.advisor | Akgül, Mustafa | |
| dc.contributor.author | Narin, Noyan | |
| dc.date.accessioned | 2020-12-02T12:52:09Z | |
| dc.date.available | 2020-12-02T12:52:09Z | |
| dc.date.submitted | 1991 | |
| dc.date.issued | 2018-08-06 | |
| dc.identifier.uri | https://acikbilim.yok.gov.tr/handle/20.500.12812/37464 | |
| dc.description.abstract | Literatürde temel problemlerden biri olarak bilinen Çinli Postacı Probleminin gerçek hayatta da mektup dağıtımı, yol bakımı, otobüs çizelgelemesi gibi birçok uygulaması vardır. Bu çalışmada, Çinli Postacı Problemi için sıralı algoritma anlatılmıştır. Buna ek olarak, hem halahazırda literatürde var olan, hem de bizim geEştirdiğimiz algoritma için uygun olacak veri yapısı sunulmuştur. Anahtar Kelimeler: Çinli Postacı Problemi, eşleme, blossom algoritmaları, sıralı algoritmalar. IV | |
| dc.description.abstract | The Chinese Postman Problem being one of the well known problems in combinatorial optimization has many applications in real life problems such as mail delivery, road maintenance and bus scheduling. In this thesis work, we present a successive algorithm for the solution of Chinese Postman Problem. Additionally, we present efficient data structures for the existing algorithms in literature and for the implementation of our successive algorithm. Keywords: Chinese Postman Problem, Matching, Blossom algorithm, Successive algorithms. in | en_US |
| dc.language | English | |
| dc.language.iso | en | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | Attribution 4.0 United States | tr_TR |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Endüstri ve Endüstri Mühendisliği | tr_TR |
| dc.subject | Industrial and Industrial Engineering | en_US |
| dc.title | A Successive algorithm for the chinese postman problem | |
| dc.type | masterThesis | |
| dc.date.updated | 2018-08-06 | |
| dc.contributor.department | Endüstri Mühendisliği Anabilim Dalı | |
| dc.subject.ytm | Chinese postman problem | |
| dc.subject.ytm | Algorithms | |
| dc.identifier.yokid | 14457 | |
| dc.publisher.institute | Mühendislik ve Fen Bilimleri Enstitüsü | |
| dc.publisher.university | İHSAN DOĞRAMACI BİLKENT ÜNİVERSİTESİ | |
| dc.identifier.thesisid | 14457 | |
| dc.description.pages | 62 | |
| dc.publisher.discipline | Diğer |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess