___

• AKYURT, İ.Z., KESKİNTURK, T., ve KALKANCI, Ç. (2015). Using genetic algorithm for winter maintenance operations: multi depot K-Chinese postman problem. EMAJ: Emerging Markets Journal, 5(1), 50-59. CHAMBERS, L. D. (1998). Complex Coding Systems. CRC Press, Inc.. DURUCASU, H. (2004). Bir Polis Devriye Aracı Rotasının Elektronik Çalışma Sayfası Modeli Yardımıyla Belirlenmesi. EISELT, H. A., GENDREAU, M., and LAPORTE, G. (1995). Arc routing problems, part I: The Chinese postman problem. Operations Research, 43(2), 231-242. EMEL, G. G., TAŞKIN, Ç., ve DİNÇ, E. (2003). Yönsüz Çinli Postacı Problemi: Polis Devriye Araçları İçin Bir Uygulama. EROGLU E., (2015). A Single Chinese Postman Problem with Two Objectives, Middle East Technical University, Master Thesis, Industrial Engineering, Ankara, Turkey. EULER, L. (1736). Solutio problematis ad geometriam situs pertinensis. Comm. Acad. Sci. Imper. Petropol., 8, 128-140. FORD, L. R., and FULKERSON, D. R. (1962). Flows in networks princeton university press. Princeton, New Jersey, 276, 22. GUAN, M. (1962). Graphic programming using odd and even points. Chinese Math., 1, 237-277. GOLDBERG, D. E. (1989). Genetic algorithm. Search, Optimization and Machine Learning, 343-349. HOLLAND, J. H. (1975). Adaptation in Natural andArtificial Systems. Ann Arbor, M]: University of Michigan Press. HUA, J., & LI-SHAN, K. (2003). Genetic algorithm for Chinese postman problems. Wuhan University Journal of Natural Sciences, 8(1), 316-318. JıANG, H., KANG, L., ZHANG, S., and ZHU, F. (2010, October). Genetic algorithm for mixed chinese postman problem. In International Symposium on Intelligence Computation and Applications (pp. 193-199). Springer, Berlin, Heidelberg. MA, Y., TIAN, G., and LI, X. (2014). Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks. Applied Mechanics & Materials. MASUYAMA, H., ICHIMORI, T., and SASAMA, T. (2006). On ability of orthogonal genetic algorithms for the mixed chinese postman problem. In ICSOFT (1) (pp. 39-46). MICHALEWICZ, Z. (1992). Binary or Float?. In Genetic Algorithms+ Data Structures= Evolution Programs (pp. 75-82). Springer, Berlin, Heidelberg. MUTLU M.,M., (2015). Üniversite Yerleşkesi Ulaşım Ana Planı Hazırlanması: Ege Üniversitesi Örneği, Yüksek Lisans Tezi, Fen Bilimleri Enstitüsü Ege Üniversitesi, İzmir. MUTLU M., M., ve ALVER Y., (2015). Ulaşım Planlama Destek Sistemi Olarak Coğrafi Bilgi Sistemleri ve Ege Üniversitesi Ulaşım Ana Planı Örneği, TMMOB İnşaat Mühendisleri Odası, 11. Ulaştırma Kongresi Bildiriler Kitabı, İstanbul. RABBANI M., and MOHAMMADI S. (2015). Modeling a Multi Depot K- Chinese Postman Problem with Consideration of Priorities for Servicing Arcs. Advances in Industrial Engineering and Management, Vol. 4, No. 2 ,147-156. RODRIGUES, A. M., and FERREIRA, J. S. (2001, July). Solving the rural postman problem by memetic algorithms. In Proceedings of the 4th Metaheuristic International Conference (MIC’2001), Porto, Portugal (pp. 679-684). SÖYLER, H., ve FENDOĞLU, E. (2018). Malatya Büyükşehir Belediyesi İlaçlama Araçlarının Güzergâhlarının Optimizasyonu. Alphanumeric Journal, 6(1), 13-24. TECİM, V., (2008). Coğrafi Bilgi Sistemleri Harita Tabanlı Bilgi Yönetimi, Renk Form Ofset Matbaacılık, Ankara. THİMBLEBY, H. (2003). The directed chinese postman problem. Software: Practice and Experience, 33(11), 1081-1096. https://www.mathworks.com/help/gads/mixed-integer-optimization.html#bs1cifg Erişim Tarihi: 01.08.2018. https://www.mathworks.com/help/gads/mixed-integer-optimization.html#mw_f7142886-3a79-4f9b-8ad9-497a54e4b2cd Erişim Tarihi: 01.08.2018. https://plugins.qgis.org/plugins/chinesepostman/ Erişim tarihi: 01.08.2018.