| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:RAZVOJ SISTEMA ZA DOLOČANJE POTI REŠEVALNEGA VOZILA GLEDE NA SPREMEMBE GOSTOTE PROMETA
Authors:ID Prša, Jan (Author)
ID Škraba, Andrej (Mentor) More about this mentor... New window
Files:.pdf UNI_Prsa_Jan_2011.pdf (2,30 MB)
MD5: EE17090FCEB9419B54882F8F19FA2D46
PID: 20.500.12556/dkum/a9714c62-7220-41d9-992a-1f4bb8137712
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FOV - Faculty of Organizational Sciences in Kranj
Abstract: V diplomski nalogi se ukvarjamo s problemom določitve najhitrejše poti reševalnega vozila v cestnem omrežju. Med mnogimi različnimi možnostmi je potrebno izbrati časovno optimalno pot od reševalne postaje do kraja nesreče. Uporabili smo Dijkstrov algoritem za iskanje časovno optimalnih poti v grafu in ga realizirali s pomočjo programskega jezika Python. V Python IDLE razvojnem okolju smo razvili aplikacijo za določitev in grafični izris poti, ki je v danem trenutku dneva najhitrejša. Program izpiše tudi predviden čas, ki bi ga potrebovalo reševalno vozilo za prihod na cilj. V zaključku je predstavljeno, kakšne bodo koristi obravnavanega sistema za določanje poti za obravnavano organizacijo.
Keywords:Iskanje najhitrejših poti, Diskretno dinamično programiranje, Dijkstrov algoritem, Optimizacija, Python IDLE
Place of publishing:Kranj
Year of publishing:2011
PID:20.500.12556/DKUM-18831 New window
COBISS.SI-ID:6898451 New window
NUK URN:URN:SI:UM:DK:FX1CNKKV
Publication date in DKUM:22.08.2011
Views:2642
Downloads:216
Metadata:XML DC-XML DC-RDF
Categories:FOV
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:DEVELOPMENT OF EMERGENCY ROUTE PLANNING SYSTEM AT VARIABLE TRAFFIC DENSITY
Abstract: In this thesis the problem of determining the fastest route of an emergency vehicle in the road network is dealt with. Amongst many different options it is necessary to choose the best suited and fastest route from the ambulance station to the scene of the accident. Dijkstra's algorithm was used to find the shortest distance in a graph which was implemented with the Python programming language. We have developed an application to determine and produce a graphic drawing of the fastest route for a particular time of day in the Python IDLE development environment. The program also writes out the estimated time of arrival for the emergency vehicle. In conclusion the benefits of this system to determine the fastest route are presented.
Keywords:Determining the fastest route, Discrete dynamic programing, Dijkstra's algorithm, Optimisation, Python IDLE


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica