|
Numerical methods and programming, 2017, Volume 18, Issue 2, Pages 158–168
(Mi vmp868)
|
|
|
|
A new algorithm for the optimization of transport networks subject to constraints
A. A. Ананьев, P. V. Lomovitskiy, D. V. Uzhegov, A. Khlyupin Center for engineering and technology for hard-to-recover reserves of Moscow Institute of physics and technology
Abstract:
A new heuristic algorithm of finding a minimum weighted Steiner tree is proposed. A transport network can be represented in the form of a directed weighted Steiner tree. Constraints are imposed on the maximal total length of communications from any terminal vertex to the root of the tree. A penalty function method is used to take the constraints into account. The effect of model parameters on the optimal network geometry is analyzed.
Keywords:
transport networks, Steiner problem, graph algorithms, optimization, constrained problems.
Received: 30.03.2017
Citation:
A. A. Ананьев, P. V. Lomovitskiy, D. V. Uzhegov, A. Khlyupin, “A new algorithm for the optimization of transport networks subject to constraints”, Num. Meth. Prog., 18:2 (2017), 158–168
Linking options:
https://www.mathnet.ru/eng/vmp868 https://www.mathnet.ru/eng/vmp/v18/i2/p158
|
Statistics & downloads: |
Abstract page: | 274 | Full-text PDF : | 155 |
|