Shortest-path based model for warehouse inner transportation optimization

Nowadays economy demands elimination of any kind of wastes, and transportation is recognized as one of them. Efficient usage of routing algorithms can significantly reduce travelling distance and transportation costs as well. This paper describes usage of the shortest-path algorithm (in this case Dijkstra´s algorithm) for inner transportation optimization in warehouses. The model integrates data such as: 2D graph of warehouse layout, its 3D extension, historical data, ABC analysis and business process model. The prototype of proposed application is tested with sample data and by simulating different working conditions. Interpretation of obtained results is given too.