ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Practical use of shortest path search algorithms in warehouse management

Damjan Perenič (2011) Practical use of shortest path search algorithms in warehouse management. EngD thesis.

[img] PDF
Download (5Mb)


    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.

    Item Type: Thesis (EngD thesis)
    Keywords: Dijkstra algorithm, graph, shortest path algorithm, automatic warehouse, program evolution, logistics
    Number of Pages: 100
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Marko Robnik Šikonja276Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00008322900)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 1325
    Date Deposited: 08 Apr 2011 14:43
    Last Modified: 13 Aug 2011 00:39
    URI: http://eprints.fri.uni-lj.si/id/eprint/1325

    Actions (login required)

    View Item