Back to search

Institutional Repository of Vilnius University

Krovinių pervežimo planavimo įrankio algoritmų palyginimas /

Abstract

dc:description

Sustainability is a much researched topic throughout Europe and elsewhere in the world. That is why, route optimization in logistics sector is not only useful for expense reduction, but for reduction of toxic emissions as well. However, there is no single solution for this task, due to various factors, such as different business models, available truck and driver data, provided information on the loading and unloading sites, tolerance for suboptimal solutions, execution speed, criteria for the best result. This document describes and compares solutions for the first and last mile delivery problem, implemented using Branch and bound, Tabu search and Simulated annealing algorithms. The solutions are optimized for the least total kilometers driven by every vehicle. Branch and bound search is used as a way to find optimal solutions, because it is an exact algorithm. When performing calculations using the Branch and bound approach, it was found that, due to very high and exponentially growing calculation times, it is only useful with small datasets. The two other algorithms are metaheuristic, therefore, their performance was measured based on the calculation time and deviation from the optimal solution. After finding the best configuration of each algorithm, it was found, that Branch and bound exact calculation algorithm provided a good way to compare the efficiency of metaheuristic algorithms. Simulated annealing algorithm provided better results than the Tabu search solution with many input datasets. Moreover, due to shorter calcualtion times, Simulatted annealing solution is more suited for calulations with large datasets.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kubolis, Tautvydas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kubolis, Tautvydas,. Krovinių pervežimo planavimo įrankio algoritmų palyginimas /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD229555392&prefLang=en_US