Abstract
The location of transport routes on a heterogeneous territory is studied. The network joins a given set of terminal points and a certain number of additional (branch) points. The problem is formulated, properties of the optimal solution for a tree-like network, and the number of branch points are studied. A stepwise optimization algorithm for a network with given adjacency matrix based on a algorithm for constructing minimal-cost routes is designed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Gordeev, E.N. and Tarastsov, O.G., The Steiner Problem: A Review, Diskret.Mat., 1993, vol. 5, issue 2, pp. 3–28.
Ford, L.R., Jr. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.
Harary, F., Graph Theory, London: Addison-Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1976.
Emelichev, V.A., Mel'nikov, O.I., Sarvanov, V.I., et al., Lektsii po teorii grafov (Lectures on Graph Theory), Moscow: Nauka, 1990.
Lotarev, D.T., Location of Communications on a Heterogeneous Territory, Avtom.Telemekh., 2001, no. 5, pp. 44–52.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lotarev, D.T., Uzdemir, A.P. Location of Transport Nets on a Heterogeneous Territory. Automation and Remote Control 63, 1146–1154 (2002). https://doi.org/10.1023/A:1016115100109
Issue Date:
DOI: https://doi.org/10.1023/A:1016115100109