Capacitated rural Chinese postman problem in road salting for snow removal operations
Neural Computing and Applications, cilt.38, sa.17, 2026 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 38 Sayı: 17
- Basım Tarihi: 2026
- Doi Numarası: 10.1007/s00521-026-12441-0
- Dergi Adı: Neural Computing and Applications
- Derginin Tarandığı İndeksler: Scopus, Aerospace Database, Applied Science & Technology Source, Compendex, Index Islamicus, INSPEC, zbMATH, Academic Search Ultimate (EBSCO), Engineering Source (EBSCO), Technology Collection (ProQuest)
- Anahtar Kelimeler: Arc routing problem, Capacitated Chinese Postman Problem, Chinese Postman Problem, Genetic algorithm, Rural postman problem
- Atatürk Üniversitesi Adresli: Evet
Özet
The capacitated Chinese postman problem is a routing problem in which vehicles start and finish their routes at a depot and pass through all edges at least once. This study proposes a new mathematical model combining the rural postman problem and the capacitated Chinese postman problem. In the application section of the study, salting operations carried out during winter road icing in Palandöken, Aziziye, and Yakutiye, which are central districts of the Erzurum Metropolitan Municipality, were discussed. The study aims to find the shortest tour route using a genetic algorithm. As a result of the study, it was determined that the genetic algorithm performed well, and it aimed to contribute to the literature by introducing, for the first time in this field, the use of capacitated rural Chinese postman methods and a new mathematical model.