Applying the Node Combination Algorithm to the Shortest Path Problem for a Logistics Firm

Kevser Arman; Ayşegül Tuş

Article Details

Applying the Node Combination Algorithm to the Shortest Path Problem for a Logistics Firm

Authors:

Kevser Arman | Ayşegül Tuş

Publisher:

Istanbul University

Main Topics:

Yöneylem

Journal:

Journal of Transportation and Logistics Vol.7 Issue 2, pp.289-302

Document Type:

Article

Publication Date:

1/2023

Document Language:

Turkish

Document ID (Org No.):

2001282790

pISSN:

2459-1718

Keywords:

Abstract:

 Logistics entails the management of all processes related to products transportation, storage, and arrival at their destination. The highly complex process of logistics activities requires products to be accurately coordinated from their starting point to their destination. This study considers a route determination problem that minimizes the total distance and time between the cities of Düzce and Artvin in Turkey for a logistics company in terms of the shortest path problem SPP, a network analysis method. The aim of the study is to provide a higher level of profitability and customer service by optimizing the distribution activities of a logistics company. The node combination algorithm has been used to solve the problem, with two different routes being obtained by considering distance and time. The studys findings show the total minimum distance to be 1,152 km and the total minimum time to be 16 hours and 33 minutes. The route the study obtained by considering the total minimum distance offers an alternative route in terms of both shorter distance and time compared to the two routes offered by Google Maps. In addition, having the route obtained by considering the total minimum time be compatible with the route with the shortest distance and time that is found among the alternatives offered by Google Maps is important in terms of demonstrating the applicability of the node combination algorithm used in the study.

 Logistics entails the management of all processes related to products transportation, storage, and arrival at their destination. The highly complex process of logistics activities requires products to be accurately coordinated from their starting point to their destination. This study considers a route determination problem that minimizes the total distance and time between the cities of Düzce and Artvin in Turkey for a logistics company in terms of the shortest path problem SPP, a network analysis method. The aim of the study is to provide a higher level of profitability and customer service by optimizing the distribution activities of a logistics company. The node combination algorithm has been used to solve the problem, with two different routes being obtained by considering distance and time. The studys findings show the total minimum distance to be 1,152 km and the total minimum time to be 16 hours and 33 minutes. The route the study obtained by considering the total minimum distance offers an alternative route in terms of both shorter distance and time compared to the two routes offered by Google Maps. In addition, having the route obtained by considering the total minimum time be compatible with the route with the shortest distance and time that is found among the alternatives offered by Google Maps is important in terms of demonstrating the applicability of the node combination algorithm used in the study.

 Logistics entails the management of all processes related to products transportation, storage, and arrival at their destination. The highly complex process of logistics activities requires products to be accurately coordinated from their starting point to their destination. This study considers a route determination problem that minimizes the total distance and time between the cities of Düzce and Artvin in Turkey for a logistics company in terms of the shortest path problem SPP, a network analysis method. The aim of the study is to provide a higher level of profitability and customer service by optimizing the distribution activities of a logistics company. The node combination algorithm has been used to solve the problem, with two different routes being obtained by considering distance and time. The studys findings show the total minimum distance to be 1,152 km and the total minimum time to be 16 hours and 33 minutes. The route the study obtained by considering the total minimum distance offers an alternative route in terms of both shorter distance and time compared to the two routes offered by Google Maps. In addition, having the route obtained by considering the total minimum time be compatible with the route with the shortest distance and time that is found among the alternatives offered by Google Maps is important in terms of demonstrating the applicability of the node combination algorithm used in the study.

 Lojistik; ürünlerin taşınması, depolanması ve nihai varış noktasına ulaşması ile ilgili tüm süreçlerin yönetimidir. Lojistik faaliyetlerinin son derece karmaşık süreci, ürünlerin başlangıç noktasından varış noktasına kadar doğru bir şekilde koordinasyonunu gerektirir. Bu çalışmada, bir lojistik firması için Düzce-Artvin arasındaki toplam mesafeyi ve süreyi en aza indiren bir rota belirleme problemi, şebeke analiz yöntemlerinden biri olan En Kısa Yol EKY problemi olarak ele alınmıştır. Çalışmanın amacı, lojistik firmasının dağıtım faaliyetlerini optimize ederek daha yüksek düzeyde kârlılık ve müşteri hizmeti sunmaktır. Problemin çözümünde düğüm kombinasyonu algoritması kullanılmış, mesafe ve süre dikkate alınarak iki farklı rota elde edilmiştir. Bulgular, toplam minimum mesafenin 1152 km ve toplam minimum sürenin 16 saat 33 dakika olduğunu göstermektedir. Çalışmada toplam minimum mesafe dikkate alınarak elde edilen rota, Google Haritaların sunduğu iki rotadan daha kısa mesafede ve sürede alternatif bir rota sunmaktadır. Ayrıca toplam minimum süre dikkate alınarak elde edilen rotanın, Google Haritaların sunduğu alternatifler arasından en kısa mesafe ve süreye ait olan rota ile uyumlu olması, düğüm kombinasyonu algoritmasının uygulanabilirliğini göstermesi açısından önemlidir.

Article Details

Applying the Node Combination Algorithm to the Shortest Path Problem for a Logistics Firm

Authors:

Kevser Arman | Ayşegül Tuş

Publisher:

Istanbul University

Main Topics:

Yöneylem

Journal:

Journal of Transportation and Logistics Vol.7 Issue 2, pp.289-302

Document Type:

Article

Publication Date:

1/2023

Document Language:

Turkish

Document ID (Org No.):

2001282790

pISSN:

2459-1718

Network Analysis

Shortest Path Problem

Node Combination Algorithm

Şebeke Analizi

En Kısa Yol Problemi

Düğüm Kombinasyonu Algoritması

En Kısa Yol Problemi

Düğüm Kombinasyonu Algoritması

Şebeke Analizi

Issues

Article Details

Authors: Kevser Arman | Ayşegül Tuş

Publisher: Istanbul University

Main Topics: Yöneylem

Journal: Journal of Transportation and Logistics Vol.7 Issue 2, pp.289-302

Document Type: Article

Publication Date: 1/2023

Document Language: Turkish

Document ID (Org No.): 2001282790

pISSN: 2459-1718

Issues

Authors:

Kevser Arman | Ayşegül Tuş

Publisher:

Istanbul University

Main Topics:

Yöneylem

Journal:

Journal of Transportation and Logistics Vol.7 Issue 2, pp.289-302

Document Type:

Article

Publication Date:

1/2023

Document Language:

Turkish

Document ID (Org No.):

2001282790

pISSN:

2459-1718