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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal location of branching points of a transportation network on a digital model of a region


    Weitere Titelangaben:

    Optimale Lage von Verzweigungen in einem Transportnetzwerk in einem Digialmodell


    Beteiligte:
    Panyukov, A.V. (Autor:in) / Peltsverger, B.V. (Autor:in) / Shafir, A.Y. (Autor:in)

    Erschienen in:

    Automation and Remote Control ; 51 , 9, PT.2 ; 1286-1293


    Erscheinungsdatum :

    1990


    Format / Umfang :

    8 Seiten, 13 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Optimal Location of Traffic Counting Points for Transport Network Control

    Bianco, L. / Confessore, G. / Reverberi, P. et al. | British Library Conference Proceedings | 1997


    DISPLAYING OPTIMAL TRANSPORTATION MODES BETWEEN TWO GEOGRAPHIC POINTS

    O'SULLIVAN SEAN | Europäisches Patentamt | 2019

    Freier Zugriff

    Displaying optimal transportation modes between two geographic points

    O'SULLIVAN SEAN | Europäisches Patentamt | 2020

    Freier Zugriff

    BRANCHING DEVICE AND RAIL TRANSPORTATION SYSTEM

    Europäisches Patentamt | 2015

    Freier Zugriff