Conclusions
-
1.
The method proposed by R. Bellman for solving the problem of choosing optimum layouts by means of dynamic programming has certain drawbacks due to the incomplete analysis of the possible layout directions.
-
2.
In this article the authors describe a method of “retrogressive corrections” which is a modification of dynamic programming and permits an improvement in the quality of machine layout plotting.
-
3.
Practical calculations have shown that the proposed method is effective, especially (in comparison with the wave algorithm) if the transport networks are optimized with allowance for the local relief and the introduction of additional vertices.
Similar content being viewed by others
Literature Cited
P. P. Borodavkin, V. L. Berezin, and S. Yu. Ruderman, Selection of Optimum Layouts for Main Pipelines [in Russian], Nedra, Moscow (1974).
R. Bellman and S. Dreyfus, Applied Dynamic Programming, Princeton Univ. Press (1962).
L. B. Abraitis, R. I. Sheinauskas, and V. A. Zhilevichyus, Computer Automation of Planning [in Russian], Sov. Radio, Moscow (1978).
G. A. Strekachinskii, A. A. Ordin, and V. A. Fedorin, Optimum Arrangement of Transport Networks on the Surfaces of Coal Mines [in Russian], Nauka, Novosibirsk (1981).
Application and Generalization of Steiner's Problem for Formulating and Solving Certain Problems in Space Saving [in Russian], TsÉMI, Moscow (1968).
Author information
Authors and Affiliations
Additional information
Translated from Fiziko-Tekhnicheskie Problemy Razrabotki Polezmykh Iskopaemykh, No. 2, pp. 87–91, March–April, 1981.
Rights and permissions
About this article
Cite this article
Strekachinskii, G.A., Ordin, A.A. & Fedorin, V.A. Improvement of dynamic programming method in planning approach tracks in mining undertakings. Soviet Mining Science 17, 164–168 (1981). https://doi.org/10.1007/BF02498416
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02498416