Primjena heurističkih algoritama u rješavanju problema usmjeravanja vozila s kapacitetnim ograničenjima

undergraduate thesis

• Title (english): Application of Heuristic Algorithms for Solving Capacitated Vehicle Routing Problem
• Author: Andrija Samodol
• Mentor: Tomislav Burić (mentor)
• Committee member: Tomislav Burić (predsjednik povjerenstva)
• Committee member: Mervan Pašić (član povjerenstva)
• Committee member: Lenka Mihoković (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2020-07-06, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

Nastojanje da se bilo kakav nepotreban trošak prijevoza robe do klijenata smanji, potaknulo je razvoj mnogih metoda za rješavanje ovog optimizacijskog problema, nazvanog problem usmjeravanja vozila (VRP). Postoju brojne inačice VRP-a ovisno o zadanim ograničenjima, predmet ovog rada je problem usmjeravanja vozila s kapacitetnim ograničenjima (CVRP). Heurističke metode, koje iako ne pronalaze uvijek optimalno rješenje, se često primjenjuju i danas kod rješavanja većih problema (s 100 ili više klijenata) zbog puno veće brzine pronalaska rješenja u odnosu na egzaktne metode. Programskom implementacijom heurističkih metoda, Clarke & Wright-ova i Sweep algoritma, uspoređeni su rezultati u ovisnosti o broju klijenata i klijentskim potražnjama te predložena poboljšanja.

Abstract (english)

The effort to reduce any unnecessary cost of transporting goods to customers has prompted the development of many methods for solving this optimization problem, called vehicle routing problem (VRP). There are numerous variants of VRP depending on the given constraints, the subject of this paper is the Capacitated vehicle routing problem (CVRP). Heuristic methods, although they do not always find the optimal solution, are often used today in solving larger problems (with 100 or more clients) due to the much higher speed of finding solutions compared to exact methods. The software application of heuristic methods, Clarke & Wright’s and Sweep algorithm, compares the results depending on the number of clients and their demands, improvements are proposed based on the results.

• Keywords: problem usmjeravanja vozila s kapacitetnim ograničenjima; CVRP; problem trgovačkog putnika; TSP; heurističke metode/algoritmi; Clarke & Wright-ov algoritam ušteda; Sweep algoritam; algoritam najbližeg susjeda
• Keywords (english): Capacitated Vehicle Routing Problem; CVRP; Traveling Salesman Problem; TSP; heuristic methods/algorithms; Clarke & Wright's savings algorithm; Sweep algorithm; nearest neighbour algorithm
• Language: croatian
• URN:NBN: urn:nbn:hr:168:666864
• Study programme: Title: Computing; Study programme type: university; Study level: undergraduate; Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2023-01-13 13:45:34