Considers the problem of optimal location of branching points of a tree network in a graph of elementary connections. This problem arises in a number of control and design tasks, in particular, the design of transportation networks on a nonhomogeneous surface. An algorithm is described with asymptotic complexity proportional to the number of branching points to be located and to the complexity of the algorithm that constructs the tree of shortest paths in a graph. Efficient implementation of the algorithm is considered for the case when the graph is a digital model of a region. Examples of optimal location of branching points are given for the design of a road network.
Optimal location of branching points of a transportation network on a digital model of a region
Optimale Lage von Verzweigungen in einem Transportnetzwerk in einem Digialmodell
Automation and Remote Control ; 51 , 9, PT.2 ; 1286-1293
1990
8 Seiten, 13 Quellen
Aufsatz (Zeitschrift)
Englisch
Optimal Location of Traffic Counting Points for Transport Network Control
British Library Conference Proceedings | 1997
|DISPLAYING OPTIMAL TRANSPORTATION MODES BETWEEN TWO GEOGRAPHIC POINTS
Europäisches Patentamt | 2019
|Displaying optimal transportation modes between two geographic points
Europäisches Patentamt | 2020
|