Praktična raba algoritmov za iskanje najkrajših poti pri upravljanju skladišč

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2011
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[D. Perenič]
UDC:	004(043.2)
COBISS:	8322900
Views:	66
Downloads:	13
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Practical use of shortest path search algorithms in warehouse management
Secondary abstract:	I present design and implementation of a logistic solution for automated warehouses. I modeled warehouses with weighted directed graphs, on which I use Dijkstra's search algorithm. This design enables implementation of an universal solution for moving transport units and goods in and out of the warehouse. I show balancing of the system activities by allocating work to various material sub-systems. The system supports dynamic rerouting based on host and other requirements and automatically finds diverting routes in case of sub-system failures. Software architecture to achieve reliability and robustness for 24/7 working environment and the value of experience and feedback on the software evolution are additionally demonstrated. The application is developed in Java and PL/SQL programming languages and runs on Oracle database. Today, this application runs in more then 50 automatic warehouses in western Europe.
Secondary keywords:	Dijkstra algorithm;graph;shortest path algorithm;automatic warehouse;program evolution;logistics;computer science;computer and information science;diploma;
File type:	application/pdf
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	100 str.
ID:	24034132