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.
An investigation of optimum algorithms for control of transportation at a crossing
Eine Untersuchung von Optimum-Algorithmen zur Steuerung der Transportation bei einer Kreuzung
Engineering Cybernetics ; 14 , 3 ; 70-77
1976
8 Seiten, 6 Quellen
Article (Journal)
English
Optimum Criss Crossing Cables in Multi-span Cable-stayed Bridges using Genetic Algorithms
Springer Verlag | 2018
|Optimum Criss Crossing Cables in Multi-span Cable-stayed Bridges using Genetic Algorithms
Online Contents | 2019
|Obstacle-crossing transportation method for logistics vehicle
European Patent Office | 2022
|Pipeline crossing anti-tilt stable transportation device
European Patent Office | 2021
|