User Guide
Why can I only view 3 results?
You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.
So many results that aren't mine?
References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.
How can I see only citations to my article?
After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.
  Citation Number 9
 Views 22
 Downloands 3
Dijkstra Algoritması Kullanılarak İpek Yolu Koridorları Arasında En Kısa Ulaştırma Güzergâhının Belirlenmesi
2021
Journal:  
Demiryolu Mühendisliği
Author:  
Abstract:

Çin, çok taraflı ulaştırma politikaları ve 21. yy. İpek Yolunu oluşturma hedefi kapsamında 2013 yılında tarihi bir adım atmıştır. “Kuşak ve Yol” sloganı ile Pekin’ den Londra’ ya ulaşan yeni bir ticaret yolunun projesini açıklamış ve güzergâh ülkelerine iş birliği çağrısına bulunmuştur. Modern İpek Yolu olarak da adlandırılan bu proje kara, deniz ve demiryolu taşımacılığının kullanılarak Çin ile güzergâhtaki 65’den fazla ülkeyi birbirine bağlanmayı, bu ülkelerde dengeli ve sürdürülebilir ekonomik kalkınmaları hedeflemektedir. Türkiye coğrafi ve jeopolitik konumu sayesinde en önemli güzergâh ülkelerinden birisi olarak bu iş birliğinden en fazla beklentisi olan ülke durumundadır. Dolayısıyla Türkiye demiryolu, karayolu, tüp geçitler ve boğaz köprüleri başta olmak üzere birçok önemli yatırıma imza atmıştır. Literatürde sosyal bilimler alanlarında İpek Yolu ile ilgili birçok çalışma mevcuttur. Fakat bu çalışmada konuya mühendislik uygulamaları yaklaşımıyla, tüm sosyal ve politik koşullardan bağımsız olarak optimal bir sonuç elde etme amacı güdülmüştür. Bu amaçla İpek yolu Koridorlarında Pekin’den Londra’ya ulaşan demiryolu ağı için toplam 26 düğümden oluşan bir graf oluşturulmuş ve en kısa yolun hesaplanması için Dijkstra algoritması Python programlama dilinde kodlanarak çözülmüştür. Modern İpek Yolu veya Orta Koridor olarak adlandırılan güzergâhın Pekin-Londra arası en kısa demiryolu güzergâhı olduğu sonucuna ulaşılmıştır.

Keywords:

Identifying the shortest transport route between the silk road corridors using the Dijkstra algorithm
2021
Author:  
Abstract:

China, multilateral transportation policies and the 21st century. In the framework of the goal of creating the Silk Road, it took a historic step in 2013. With the slogan "Course and Road", he announced the project of a new trade road from Beijing to London and called for cooperation with the routes. This project, also known as the Modern Silk Road, aims to connect China and more than 65 countries on the route, using land, sea and rail transport, to balanced and sustainable economic development in these countries. Turkey, thanks to its geographical and geopolitical position, is one of the most important routes countries in the country with the highest expectation of this cooperation. Therefore, Turkey has signed many important investments, including railway, road, pipeline and throat bridges. There are many studies on the Silk Road in the fields of social sciences in literature. But in this study, the aim of the subject was to obtain an optimal result, regardless of all social and political conditions, by the approach of engineering practices. For this purpose, a graph consisting of a total of 26 nodes for the railway network from Beijing to London on the Silk Road Corridor was created and the Dijkstra algorithm for the calculation of the shortest route was resolved by coding in Python programming language. The modern Silk Road or Central Corridor is the shortest railway route between Beijing and London.

Keywords:

Determination Of The Shortest Transport Route Among Silk Road Corridors By Using Dijkstra Algorithm
2021
Author:  
Abstract:

China took a historic step in 2013 within the scope of its multilateral transportation policies and the goal of creating the Silk Road of the 21st Century. With the slogan of "Belt and Road", it announced the project of a new trade route from Beijing to London and called for cooperation with the route countries. This project, also called the Modern Silk Road; It aims to connect China and more than 65 countries on the route by using land, sea and rail transport, and to achieve balanced and sustainable economic development in these countries. Turkey is one of the most important routes due to its geographical and geopolitical position moreover which has the greatest expectations from this cooperation. Therefore, Turkey has made many important investments, especially railway, highway, tube crossings and Bosphorus bridges. There are many studies in the literature about the Silk Road in social sciences. However, in this study, it is aimed to provide an optimal result by approaching the subject with the engineering applications independent from all social and political conditions. For this purpose, a graph consisting of a total of 26 nodes was created for the railway network reaching from Beijing-China to London-England in Silk Road Corridors and the shortest path has been calculated with Dijkstra's Algorithm scripted in Python. The results showed that the route which called the Modern Silk Road or Middle Corridor is the shortest railway route between Beijing and London.

Keywords:

Citation Owners
Attention!
To view citations of publications, you must access Sobiad from a Member University Network. You can contact the Library and Documentation Department for our institution to become a member of Sobiad.
Off-Campus Access
If you are affiliated with a Sobiad Subscriber organization, you can use Login Panel for external access. You can easily sign up and log in with your corporate e-mail address.
Similar Articles










Demiryolu Mühendisliği

Field :   Mühendislik

Journal Type :   Uluslararası

Metrics
Article : 237
Cite : 477
2023 Impact : 0.906
Demiryolu Mühendisliği