Qualitative research of routing methods based on wave algorithm and algorithm A* for industrial plants

Abstract

Based on the example of two typical arrangements of industrial companies and application of von Neumann and Moore
neighborhoods for wave algorithm and А* algorithm we conducted an analysis of impact of routing method and dimension of
discrete operational field on the percentage of its coverage, on the arrangement of routes and time expenditure for calculations. It is stated in particular that the path for routes arrangement is influenced not only by the synthetic method but in some cases also by the applied dimension of discrete operational field grid. We revealed the dependency between computation time and grid dimensions. We provided diagrams for the length of routes obtained at various routing methods and grid dimensions. Computational experiments are conducted at discrete operational field with grid dimensions of 40, 20, 10, 5, 2 and 1 pixel.