Abstract Optimization of complex developing transport networks is considered. For a deterministic dynamic problem a three-stage approach with iteration recounting is used. The dialogue system of optimization is realized by EC-computers. For a stochastic case an additional qualitative analysis is made. The conditions for the initial stochastic data are given to guarantee the convexity of constraints.
Dynamic and stochastic optimization of transport networks
1986-01-01
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Optimization of transport networks
Elsevier | 1975
|Optimal path in dynamic and stochastic networks
IEEE | 2009
|The Measurement of Reliability in Stochastic Transport Networks
British Library Conference Proceedings | 2001
|