Usmjeravanje dostavnih vozila uz skladišna ograničenja

master's thesis

• Title (english): Routing of delivery vehicles with loading constraints
• Author: Filip Hustić
• Mentor: Mario Bukal (mentor)
• Committee member: Mario Bukal (predsjednik povjerenstva)
• Committee member: Mate Puljiz (član povjerenstva)
• Committee member: Stjepan Šebek (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2022-07-06, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

U ovome radu predstavili smo problem usmjeravanja vozila uz problem smještaja
paketa u vozilo pri kojem uvodimo dodatna skladišna ograničenja kako bi opisali situ-
acije koje možemo susresti u realnom problemu transportne logistike. Cilj problema
je naći skup ruta za koje će prijed̄ena udaljenost na rutama biti najmanja moguća, s
time da smještaj paketa na pojedinu rutu mora zadovoljavati skladišna ograničenja.
Stoga smo razvili metodu za minimizaciju prijed̄enih udaljenosti koja poziva metodu
za smještaj paketa kako bi se osiguralo zadovoljavanje skladišnih ograničenja.
Metoda koju koristimo temelji se na optimizaciji udaljenosti unutar jedne rute, za
koju koristimo lokalno pretraživanje, i optimizaciji udaljenosti izmed̄u više ruta, za
koju koristimo tabu pretraživanje. Za problem smještaja paketa razvili smo brzu he-
uristiku koja se temelji na smanjenju izgubljenog prostora prilikom smještaja pojedi-
nog paketa.

Abstract (english)

In this paper we introduced the vehicle routing problem in addition with the three-dimensional capacitated loading problem. To simulate cases from the real world transport logistics we introduced additional constraints which are mostly based on the way packages are placed into the vehicle. The goal of the problem is to find the set of the routes which will minimize traveled distances on the routes, while making sure that packages from individual routes can be placed into vehicle without violating any constraints. We introduced the method that minimizes traveled distances while routinely calling the method for placing packages in the vehicle to make sure that constraints stay satisfied. Our method is based on the optimisation of the distances on the single route, for which we use local search, and optimisation of the distances between multiple routes for which we use the tabu search. For the loading problem we developed a quick heuristic which is based on reduction of the wasted space while packing individual packages.

• Keywords: Problem usmjeravanje vozila; Problem trodimenzionalnog smještaja paketa; Tabu pretraživanje
• Keywords (english): Vehicle routing problem; Three-dimensional packing problem; Tabu search
• Language: croatian
• URN:NBN: urn:nbn:hr:168:133891
• Study programme: Title: Computing; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2023-01-13 15:05:55