Global Optimum Search in the Network Design Problem

Standard

Global Optimum Search in the Network Design Problem. / Крылатов, Александр Юрьевич.

In: Computational Mathematics and Mathematical Physics, Vol. 64, No. 10, 01.10.2024, p. 2238-2255.

Research output: Contribution to journal › Article › peer-review

Author

Крылатов, Александр Юрьевич. / Global Optimum Search in the Network Design Problem. In: Computational Mathematics and Mathematical Physics. 2024 ; Vol. 64, No. 10. pp. 2238-2255.

BibTeX

@article{2673dfa8cf174b17a87e4fb77744abe4,

title = "Global Optimum Search in the Network Design Problem",

abstract = "Abstract: The global optimum search in the network design problem for the case of networks with disjoint paths is considered. In the considered formulation of the problem, the manager of a network invests in the capacities of its elements, seeking to minimize the total delay arising from the equilibrium flow assignment. It is proven that the solution to the problem under study must necessarily solve a certain minimax problem. Optimality conditions for solutions of the minimax problem are found under fairly natural assumptions. Based on the results, a new algorithm is developed for optimizing the topology of a network with disjoint paths.",

keywords = "equilibrium flow assignment, network design problem",

author = "Крылатов, {Александр Юрьевич}",

year = "2024",

month = oct,

day = "1",

doi = "10.1134/s0965542524701239",

language = "English",

volume = "64",

pages = "2238--2255",

journal = "Computational Mathematics and Mathematical Physics",

issn = "0965-5425",

publisher = "МАИК {"}Наука/Интерпериодика{"}",

number = "10",

}

RIS

TY - JOUR

T1 - Global Optimum Search in the Network Design Problem

AU - Крылатов, Александр Юрьевич

PY - 2024/10/1

Y1 - 2024/10/1

N2 - Abstract: The global optimum search in the network design problem for the case of networks with disjoint paths is considered. In the considered formulation of the problem, the manager of a network invests in the capacities of its elements, seeking to minimize the total delay arising from the equilibrium flow assignment. It is proven that the solution to the problem under study must necessarily solve a certain minimax problem. Optimality conditions for solutions of the minimax problem are found under fairly natural assumptions. Based on the results, a new algorithm is developed for optimizing the topology of a network with disjoint paths.

AB - Abstract: The global optimum search in the network design problem for the case of networks with disjoint paths is considered. In the considered formulation of the problem, the manager of a network invests in the capacities of its elements, seeking to minimize the total delay arising from the equilibrium flow assignment. It is proven that the solution to the problem under study must necessarily solve a certain minimax problem. Optimality conditions for solutions of the minimax problem are found under fairly natural assumptions. Based on the results, a new algorithm is developed for optimizing the topology of a network with disjoint paths.

KW - equilibrium flow assignment

KW - network design problem

UR - https://www.mendeley.com/catalogue/466f3c37-a6be-317e-b539-a5c94184c5d7/

U2 - 10.1134/s0965542524701239

DO - 10.1134/s0965542524701239

M3 - Article

VL - 64

SP - 2238

EP - 2255

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 10

ER -

ID: 128361082