Recent Application of Dijkstra’s Algorithm in the Process of Production Planning

Abstract

This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption. Dijkstra´s algorithm solves many of the shortest path problems observed in the production planning of raw materials. The algorithm requires knowledge of the relative distance between the vertices and the definition of the Euclidean distance of the vertices from the target vertex. The algorithm scans all of the paths and chooses the one with the minimum distance. At the same time, it would be able to identify the places of sale of raw materials and transport sites for the transportation of raw materials. It would have a database of point and line sources of occurrence (mining, deposit), places of transport (transmission network), and points of sale (seller). At present, geo-statistics is becoming an essential tool for solving various problems in modern deposit geology. Its results are used to calculate reserves and the economic valuation of the deposit. In the process of production planning, it is necessary to constantly process and analyze the geological information obtained during the mining survey.