| dc.description.abstract |
The graph structure of the intersection points on the street and avenue in Malatya Province was given in Figure A. While the width of the nodes forming the intersections refers to the nodes with high centrality value, the length of the roads between the intersections is expressed by the edge thicknesses. Purpose: This study aims to determine the efficient of intersection points in Malatya City within the transportation network according to their geographical locations. The determined intersection points are comprised of streets and boulevards containing more than 90 percent of the city population determined using the land use plan. The centrality values of the intersections will be calculated with four different centricity algorithms and the advantages and disadvantages of these algorithms will be determined. Theory and Methods: Real distance lengths are used for the roads connecting the intersection points modeled on the graph.(as meter) Pagerank, Eigenvector, Closeness, Betweenness centrality algorithms were applied in the weighted graph. Results were combined with a homogeneous approach by normalized. Results: As a result of the study, centrality values indicating the importance of the intersection points on the main arteries used by more than 90 percent of the population were determined. The unique aspects of four different algorithms were examined in detail and a more successful centrality value was achieved by applying the properties of all of them equally with a unifying approach. Conclusion: The results obtained revealed the importance of intersection points according to their location in the city. In this way, it gives important ideas for the investment and maintenance operations to be made at the intersections. In addition, the findings of the study can be used as decision support systems for road network management, planning, and urban traffic construction optimizations. © 2022 Gazi Universitesi Muhendislik-Mimarlik. All rights reserved. |
|