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.

PDF Download (5Mb)

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.

Actions (login required)