Dergiler / Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi / 2018 / Cilt: 8 - Sayı: 4
Karayolları Bakım Çalışmasında Kullanılan Araçların Güzergâhlarının Hiyerarşik Çinli Postacı Problemi Kullanılarak Düzenlenmesi
- Sayfa
- 107–115
- DOI
- —
Özet
Ayrıt rotalama problemleri, kombinatoriyel optimizasyon problemlerinden biridir.
Abstract
The arc routing problems are one of the combinatorial optimization problems.The aim of solving such problems is to determine a least cost tour which covers all or subsetof arcs in a graph. The Hierarchical Chinese Postman Problem (HCPP) is a variant of ChinesePostman Problem, one of the most common arc routing problems. There are many applicationareas of HCPP in real life, such as snow plowing, garbage collection, road maintenance, letterdelivery, routing of patrolling vehicles. In this study, it was aimed to find the best / nearest routeswith the least cost by the HCPP approach in order to carry out the road maintenance activitieswhich the roads connected to the 12th Regional Directorate of Highways. A nearest neighborsearch based algorithm was developed in order to solve the handled large-scale problem. Theproposed algorithm was conducted on the road network involved and an efficient result wasobtained.