Finding the Shortest Path in the Transport Network

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.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