Access restricted to students and staff of home institution
master's thesis
14   1
An application of the shortest path and the optimal assignment algorithms
Josip Barun (2015)
University of Split
University of Split, Faculty of science
Department of Informatics
Metadata
TitlePrimjena algoritama najkraćeg puta i optimalne asignacije
AuthorJosip Barun
Mentor(s)Ivica Boljat (thesis advisor)
Abstract
Cilj ovog rada je pokazati kako možemo pomoću algoritama najkraćeg puta i optimalne asignacije, minimizirati ukupni trošak prijevoza. Prikazana je primjena algoritama najkraćeg puta i optimalne asignacije na primjeru taksi službe u Splitu. Pronalaženje najkraćeg puta zasnovano je na Dijkstrinom algoritmu, a optimalna asignacija na mađarskom algoritmu. Primjenom Dijkstrin algoritma izračunavamo najkraći put između dva čvora grafa, pri čemu čvorovi grafa predstavljaju gradske lokacije s kojih stižu istovremeni pozivi za taksi uslugom te lokacije na kojima se u momentu poziva nalaze slobodna taksi vozila. Na temelju algoritma optimalne asignacije slobodna se vozila upućuju na mjesta poziva tako da ukupni put koji prijeđu sva vozila bude minimalan. Opisani program je implementiran uz korištenje ASP.NET tehnologije, programskog jezika C# te MS SQL servera kao sustava za upravljanje relacijskom bazom podataka.
Keywordsalgorithm shortest path algorithm optimal assignment ASP.NET SQL
Parallel title (English)An application of the shortest path and the optimal assignment algorithms
Committee MembersIvica Boljat (committee chairperson)
Tonći Dadić (committee member)
Saša Mladenović (committee member)
GranterUniversity of Split
University of Split, Faculty of science
Lower level organizational unitsDepartment of Informatics
PlaceSplit
StateCroatia
Scientific field, discipline, subdisciplineTECHNICAL SCIENCES
Computing
Study programme typeuniversity
Study levelgraduate
Study programmeComputer Science; specializations in: major in teaching
Study specializationmajor in teaching
Academic title abbreviationmag. educ. inf.
Genremaster's thesis
Language Croatian
Defense date2015-11-23
Parallel abstract (English)
The aim of this work is to show usage of the shortest path algorithm as well as optimal assignment in order to reduce the total transportation cost to a minimum. The application of algorithms is explained on an example of taxi service in Split, Croatia. The shortest path is found using Dijkstra’s algorithm, while the optimal assignment is achieved by the Hungarian algorithm. The former algorithm calculates the shortest path between two nodes and saves the data in the appropriate database. The optimal assignment takes into account the necessary information about distances from the current positions of taxi cab locations and arriving calls such that total distance between customers’ locations and assigned taxi cabs is minimal. The developed web application is based on the ASP.NET – technology, the language behind is C#, while the RDBM system is MS SQL server.
Parallel keywords (Croatian)algoritam algoritam najkraćeg puta optimalna asignacija ASP.NET SQL
Resource typetext
Access conditionAccess restricted to students and staff of home institution
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
URN:NBNhttps://urn.nsk.hr/urn:nbn:hr:166:375857