Algorithms for optimum control of transportation flows through an intersection are derived and investigated by taking into account the statistical parameters of the flows and a specific situation. The motion of transported goods is treated as a controlled Markov process. An optimum algorithm is the one which minimizes the loss function, which is the sum of the average waiting time for the machines to to through the junction and of the penalty which is proportional to the average number of refusals of service per unit of time. A solution has been obtained by the iterative method of White-Schweitzar, with a computation and extrapolation of advanced estimates of the minimum loss.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    An investigation of optimum algorithms for control of transportation at a crossing


    Additional title:

    Eine Untersuchung von Optimum-Algorithmen zur Steuerung der Transportation bei einer Kreuzung


    Contributors:

    Published in:

    Engineering Cybernetics ; 14 , 3 ; 70-77


    Publication date :

    1976


    Size :

    8 Seiten, 6 Quellen


    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Optimum Criss Crossing Cables in Multi-span Cable-stayed Bridges using Genetic Algorithms

    Arellano, Hiram / Tolentino, Dante / Gómez, Roberto | Online Contents | 2019


    Optimum Criss Crossing Cables in Multi-span Cable-stayed Bridges using Genetic Algorithms

    Arellano, Hiram / Tolentino, Dante / Gómez, Roberto | Springer Verlag | 2018


    Field ridge-crossing transportation device

    CHEN SAIYING | European Patent Office | 2022

    Free access

    Pipeline crossing anti-tilt stable transportation device

    LIU LE | European Patent Office | 2021

    Free access

    Obstacle-crossing transportation method for logistics vehicle

    ZHOU SHAONING / ZHANG YANBING / GONG XIN et al. | European Patent Office | 2022

    Free access