Određivanje najkraćeg puta u prometnoj mreži

master's thesis

• Title (english): Finding the Shortest Path in the Transport Network
• Author: Matija Šanjug
• Mentor: Jasmina Pašagić Škrinjar (mentor)
• Committee member: Mario Šafran (predsjednik povjerenstva)
• Committee member: Tomislav Rožić (član povjerenstva)
• Committee member: Ratko Stanković (član povjerenstva)
• Granter: University of Zagreb; Faculty of Transport and Traffic Sciences; (Division of Intelligent Transport Systems and Logistics); (Department of Transport Logistics); Zagreb
• Defense date and country: 2019-09-25, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Traffic and Transport Technology; Intelligent Transport Systems and Logistics

Abstract

U upravljanju i planiranju logističkim procesima opskrbnoga lanca skoro svi logistički problemi koji se pojavljuju spadaju u probleme optimiranja, odnosno riječ je o problemima koji imaju više mogućih rješenja. Kroz ovaj rad bit će razrađene različite metode određivanja najkraćeg puta u transportnoj mreži. U radu će se koristiti i analizirati metode: Clark-Wrightov algoritam ušteda, Clark-Wright-ov algoritam ušteda – metoda s indikatorom T, metoda najbližeg neposjećenog susjeda, metoda grananja i ograničavanja te metoda linearnog programiranja. Tim metodama će se tražiti najkraći put u prometnoj mreži. U istraživanju će se analizirati metode, usporediti ih te naglasiti njihove pozitivne i negativne strane koje će biti prikazane na realnim primjerima. Cilj istraživanja je pronaći i prepoznati prednosti i mane pojedine metode te pronaći najpogodniju metodu.

Abstract (english)

In the management and planning of supply chain logistics processes, almost all of the logistical problems that arise are optimization problems, that is, problems that have several possible solutions. Through this paper, different methods of determining the shortest path in the transport network will be elaborated. Methods that will be used and analyzed in the paper are: Clark-Wright Savings Algorithm, Clark-Wright Savings Algorithm - T Indicator Method, Nearest Neighbor Neighbor Method, Branching and Limiting Method, and Linear Programming Method. These methods will look for the shortest route in the transport network. The research will analyze the methods, compare them and highlight their positives and negatives, which will be presented on real life examples. The aim of the research is to find and identify the advantages and disadvantages of each method and find the most suitable method.

• Keywords: optimizacija ruta; najkraći put; matematičke metode; metoda linearnog programiranja
• Keywords (english): route optimization; the shortest path; mathematical methods; linear programming method
• Language: croatian
• URN:NBN: urn:nbn:hr:119:550762
• Study programme: Title: Intelligent Transport Systems and Logistics; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra inženjer/inženjerka prometa (magistar/magistra inženjer/inženjerka prometa)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Open access
• Created on: 2020-01-30 11:01:46