Chinese Postman Problem with Dynamic Start/End Point
Özet
The Chinese Postman Problem (CPP) is a variant of the arc routing problem, and it is a
routing problem that aims to return to the starting point with the shortest tour length by passing through
all arcs at least once in a network consisting of nodes and arcs. CPP has many real-life applications
such as snow removal and road maintenance work. In the literature, it is possible to see different CPP
applications by adding new constraints to the problem. In almost all of these studies, the starting point
is determined as a fixed point and it is aimed that the tour or tours to be created will start from this point
and end at this point. In this study, a new mixed integer model for CPP is proposed and it is aimed to
determine the most appropriate starting or ending point by the model. The proposed model was run on
a small sample network and the results showed that tours with shorter lengths were obtained.
Sürdürülebilir Kalkınma Amaçları
-
SKA 7: Erişilebilir ve Temiz Enerji
-
SKA 11: Sürdürülebilir Şehir ve Yaşam Alanları
Atıf için künye
Yılmaz, M. (2023). Chinese Postman Problem with Dynamic Start/End Point. International Conference on Science, Engineering Management and Information Technology, Ankara (ss. 257–261).
BibTeX
@inproceedings{yilmaz2023-182687,
author = {Yılmaz, Mustafa},
title = {Chinese Postman Problem with Dynamic Start/End Point},
booktitle = {International Conference on Science, Engineering Management and Information Technology},
address = {Ankara},
year = {2023},
pages = {257--261},
url = {https://akademik.atauni.edu.tr/yayinlar/182687-chinese-postman-problem-with-dynamic-startend-point}
}