Warehouse Modeling Using Graphical User Interface
This paper describes a new algorithm which enable efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any place in warehouses and does so significantly faster than traditional approaches. For this purpose an algorithm based on Breadth first search, image processing “skeletonization” and Dijkstra algorithm was proposed. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is approximately hundreds of microseconds using routing table and even it is independent on size of warehouse instead of using Dijkstra algorithm.
Document typePeer reviewed
Document versionFinal PDF
SourceProceedings of the 22nd Conference STUDENT EEICT 2016. s. 273-275. ISBN 978-80-214-5350-0
- Student EEICT 2016