Automation of clustering methods at planning logistics processes with georeferenced

This paper presents an algorithm for automated method of finding the optimal position of cluster centers in logistics tasks. This algorithm has been considered as part of a complex algorithm of finding the optimal solution of logistics tasks with georeferenced. In the work the cluster centers has been considered as a temporary storages, which is connected with other terminals by shortest path. Several algorithms of cluster centers finding was evaluated in terms obtaining the optimal plan for transportation of cargo. The costs amount for transportation and servicing of a cargo is considered as an estimation of optimality. The dependence of total transport expenses on the number of a cluster centers was taken into account also. The algorithm was realized in software prototype and was analyzed solving a particular transportation problem.