## №2, 2024

In recent years, studies on smart cities have attracted much attention in the literature. In the smart city concept, urban public transportation network studies are one of the most important issues. After the 2000s, smart cards have been widely used in city public transportation systems. Using the data collected through the smart card, many models have been created in line with the smart city concept. In the literature, there are various optimal route recommendation models using urban public transportation network and city smart card data. In this study, some current models built on the basis of urban public transportation network and smart card data are discussed. The specifications of the models, their important differences, the topologies they use, optimization criteria, and computational complexities are analyzed. Dijkstra’s algorithm, which is widely used for the solution of optimal route recommendation models, and its various modifications are analysed. Additionally, various models developed by applying fuzzy logic are examined. Comparative analysis of PTN models is given (pp.14-23).

**Keywords:**

*Public transportation, Optimal path, Dijkstra algorithm, Smart card data, Fuzzy model*

Bagchi, M., White, P.R. (2005). The potential of public transport smartcard data, Transport Policy, 12, 464–474.

Barry, J., Newhouser, R., Rahbee, A., & Sayeda, S. (2002). Origin and destination estimation in New York City with automated fare system data, Transportation Research Record, 1817, 183-187.

Bozyiğit, A., Alankuş, G., & Nasiboğlu, E. (2017). Public transport route planning: Modified dijkstra's algorithm, 2017 International Conference on Computer Science and Engineering (UBMK), Antalya, pp. 502-505, doi: 10.1109/UBMK.2017.8093444.

Bozyigit, A., Alankus, G., & Nasibov, E. (2018). A Public Transport Route Recommender Minimizing the Number of Transfers, Sigma J Eng & Nat Sci, 9(4), 437-446.

Ceder, A. (2007). Public transit planning and operation: theory, modelling and practice, Butterworth-Heinemann, Oxford.

Chen, Y.-Z., Li, N., & He, D.-R. (2007). A study on some urban bus transport networks, Physica A: Statistical Mechanics and Its Applications, 376(1-2), 747–754.

Deng, Y., Chen, Y., Zhang, Y., & Mahadevan, S. (2012). Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment, Applied Soft Computing, 12, 1231–1237.

Dijkstra, E.W. (1959). A note on two problems in connexion with graphs, Numerische Mathematik, 1, 269–271. doi:10.1007/BF01386390.

García-Heredia, D., Molina, E., Laguna, M., & Alonso-Ayuso, A. (2021). A solution method for the shared resource-constrained multi-shortest path problem, Expert Systems with Applications, 182, 115193.

Hui, C., Su, B., Zhou, Y., & He, D. (2007). Assortativity and act degree distribution of some collaboration networks, Physica A: Statistical Mechanics and its Applications, 383(2), 687–702.

Ji, X., Iwamura, K., & Shao, Z. (2007). New models for shortest path problem with fuzzy arc lengths, Appl. Math. Model., 31, 259–269.

Khaing, O., Wai, H.H., Myat, E.E. (2018). Using Dijkstra’s Algorithm for Public Transportation System in Yangon Based on GIS, International Journal of Science and Engineering Applications, 7(11), 442-447.

Long, D. -H., Tan, J. (2020). Optimal Path Selection Model of Public Transportation Network Based on Improved Genetic Algorithm, IEEE International Conference on Industrial Application of Artificial Intelligence (IAAI), Harbin, China, pp. 345-350.

López, D., Lozano, A. (2014). Techniques in Multimodal Shortest Path in Public Transport Systems, Transportation Research Procedia, 3, 886-894.

Mahdavi, I., Nourifar, R., Heidarzade, A., & Amiri, N.M. (2009). A dynamic programming approach for finding shortest chains in a fuzzy network, Applied Soft Computing, 9, 503–511.

Marc, B. (2011). Spatial networks. Physics Reports, 499(1–3), 1–101.

Munizaga, M.A., Palma, C. (2012). Estimation of a disaggregate multimodal public transport origin-destination matrix from passive smartcard data from Santiago, Chile, Transportation Research Part C, 24, 9-18.

Nasiboglu, E.N., Kuvvetli, U., Ozkilcik, M., & Eliiyi, U. (2012). Origin-Destination Matrix Generation Using Smart Card Data: Case Study for Izmir, Proceedings of the IV International Conference “Problems of Cybernetics and Informatics” (PCI'2012), Baku, Azerbaijan, 1, 188-191.

Nasiboğlu, R. (2021). Otobüs İçi Yoğunluk Oranını Dikkate Alan Bulanık Optimal Güzergah Öneri Modeli ve Çözüm Algoritması. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 25(2), 432-440.

Nasiboglu, R. (2022). Dijkstra solution algorithm considering fuzzy accessibility degree for patch optimization problem, Applied Soft Computing, 130, 109674

Nasibov, E.N., Diker, A., & Nasibov, E. (2016). A multi criteria route planning model based on fuzzy preference degrees of stops, Applied Soft Computing, 49, 13-26.

Panagiotis, A., Fisk, D. (2006). Large subway systems as complex networks, Physica A: Statistical Mechanics and its Applications, 367(15), 553–558.

Pelletier, M.P., Trépanier, M., & Morency, C. (2011). Smart card data use in public transit: A literature review, Transportation Research Part C: Emerging Technologies, 19, 557-568.

Ray, A., Sharma, H., & Sharma, D. (2022). Analysis and Design of Public Transport Route Planner: Dijkstras Algorithm, International Journal for Research in Applied Science & Engineering Technology (IJRASET), 10(6), 4571-4575.

Schrijver, A. (2012). On the history of the shortest path problem, Documenta Mathematica, Extra Volume ISMP, 155–167.

Sienkiewicz, J., Hołyst, J.A. (2005). Statistical analysis of 22 public transport networks in Poland, Physical Review E, 72(4), 046127.

Sui, Y., Shao, F., Yu, X., Sun, R., & Li, S. (2019). Public transport network model based on layer operations, Physica A: Statistical Mechanics and its Applications, 523(1), 984-995.

Tirastittam, P., Waiyawuththanapoom, P. (2014). Public Transport Planning System by Dijkstra Algorithm: Case Study Bangkok Metropolitan Area, World Academy of Science, Engineering and Technology International Journal of Computer and Information Engineering, 8(1), 54-59.

Trepanier, M., Tranchant, N., & Chapleau, R. (2007). Individual trip destination estimation in a transit smart card automated fare collection system, Journal of Intelligent Transportation Systems, 11(1), 1-14.

Vito, L., Marchiori, M. (2001). Efficient behavior of small-world networks, Phys. Rev. Lett. 87(19), 198701.

Von Ferber, C., Holovatch, T., Holovatch, Y., & Palchykov, V. (2007). Network harness: metropolis public transport, Physica A: Statistical Mechanics and Its Applications, 380(1-2), 585–591.

Von Ferber, C., Holovatch, T., Holovatch, Y., & Palchykov, V. (2009). Public transport networks: empirical analysis and modeling, The European Physical Journal B—Condensed Matter and Complex Systems, 68(2), 261–275.

Wilson, N.H., Zhao, J., & Rahbee, A. (2009). The potential impact of automated data collection systems on urban public transportation planning, In Wilson, N.H., Nuzzolo, A., (Eds.). Schedule-based modeling of transportation network, Springer, 75-99.

Zhang, L., Ma, X., Wang, H., Feng, M., & Xue, S. (2013). Modelling and optimisation on bus transport system with graph theory and complex network, International Journal of Computer Applications in Technology, 48(1), 83–92.

Zhang, L., Ma, H., Sun, B., Li, Y., Wang, M., & Xue, S. (2013). Computing and application on complex bus network system, International Journal of Information and Computer Science, 2(7), 127–132.

Zhu, Z.-T., Zhou, J., Li, P., & Chen, X.-G. (2008). An evolutionary model of urban bus transport network based on B-space, Chinese Physics B, 17(8), 2874–2880.