20.500.12556/RUL-174419 Algoritmično načrtovanje transportov po metodi najbližjih sosedov z namenom višanja učinkovitosti tovornjakov magistrsko delo Algorithmic transport planning using the nearest neighbor method to increase truck efficiency Kot posledica globalizacije in gospodarske rasti je v svetu čedalje več potreb po transportu blaga, kar ima negativne posledice na okolje zaradi večje porabe goriva in povišane obrabe cestišč ter vozil. Povišan tovorni promet prinaša k povišanju izpuhov toplogrednih plinov in povišani meri prašnih delcev v ozračju. K reševanju te problematike sem pristopil z vidika višanja učinkovitosti posameznih tovornjakov in logističnih podjetij z uporabo algoritmično sestavljenega načrta transportov. Algoritem iz danega nabora transportnih naročil in nabora tovornjakov delegira, kateri tovornjak bo prevzel posamezne tovore in tako sestavi načrt transportov v danem časovnem obdobju. Cilj algoritma je minimizacija praznega prostora na tovornjakih in posledično minimizacija praznih LDM-kilometrov. Rezultate algoritma sem primerjal s podatki o načrtu transportov, ki ga je sestavilo veliko transportno podjetje iz Slovenije v maju 2024. Ugotovil sem, da se načrtu transportov vsekakor da zvišati učinkovitost, vendar je za dobro načrtovanje treba imeti zelo natančne podatke o transportnih naročilih, s pomočjo katerih je možno razviti dovolj dober hevristični algoritem za načrtovanje transportov s prilagojeno metodo najbližjih sosedov. As a result of globalization and economic growth, there is an increasing demand for the transport of goods worldwide, which has a negative impact on the environment due to higher fuel consumption and increased wear and tear on roads and vehicles. Increased freight traffic leads to higher greenhouse gas emissions and increased levels of particulate matter in the atmosphere. I approached this problem from the perspective of increasing the efficiency of individual trucks and logistics companies by using an algorithmically composed transport plan. The algorithm delegates which truck will take on individual loads from a given set of transport orders and a set of trucks, thus creating a transport plan for a given time period. The goal of the algorithm is to minimize empty space on trucks and, consequently, minimize empty LDM kilometers. I compared the results of the algorithm with data on the transport plan compiled by a large transport company from Slovenia in May 2024. I found that the efficiency of the transport plan could definitely be improved, but good planning requires very accurate data on transport orders, which can be used to develop a sufficiently good heuristic algorithm for transport planning using an adapted nearest neighbor method. LDM-kilometri hevrističen algoritem načrt transportov metoda najbližjih sosedov toplogredni plini LDM-kilometers heuristic algorithm transport plan nearest neighbour method greenhouse gases true true false L. Štemberger Slovenski jezik Angleški jezik Magistrsko delo/naloga 2025-10-02 08:30:49 2025-10-02 08:30:55 2025-11-22 03:55:54 0000-00-00 00:00:00 2025 0 Ljubljana 0 Ljubljana 1 spletni vir (1 datoteka PDF (75 str.)) 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 656.1:005:004.021(043.2) 182042 254609667 22556.pdf 22556.pdf 1 0817C7E247C7C1C88386F0CEE74399D8 a0e88fa4665c10bd9d3ebcf414b78459181aad02c28f274774682922362e687a 29b641b5-9f59-11f0-9328-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=219223 Fakulteta za družbene vede 0 0 0