Designing an efficient network under cost uncertainty subject to constrained budget and multiple objectives

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F25%3A101911" target="_blank" >RIV/60460709:41110/25:101911 - isvavai.cz</a>

Result on the web

<a href="https://sor.fov.um.si/" target="_blank" >https://sor.fov.um.si/</a>

DOI - Digital Object Identifier

—

Result language

čeština

Original language name

Designing an efficient network under cost uncertainty subject to constrained budget and multiple objectives

Original language description

We discuss a specific instance of the maximum flow problem in a network with multiple objectives. The edge capacities of the network are not explicitly given and are subject to predefined interval bounds. Moreover, the unit costs are known for the edge capacity building, and the total costs are constrained by the available budget. The building costs, however, are subject to uncertainty and may vary by predefined deviations, too. We intend to propose an efficient network capacity design that respects all objectives (one of which is always maximising the network flow from source to terminal vertex) and a given budget. The proposed design is robust to cost changes under a given degree of uncertainty provided by a decision-maker. We take advantage of the DeNovo optimisation framework and $Gamma$-robustness principles. We compare our approach with classic multiobjective optimisation techniques through numerical experiments on an artificial example. It occurs that none of the approaches is superior to the others in a multiobjective sense, but the one we propose yields somewhat better results in average efficiency score.

Czech name

Designing an efficient network under cost uncertainty subject to constrained budget and multiple objectives

Czech description

We discuss a specific instance of the maximum flow problem in a network with multiple objectives. The edge capacities of the network are not explicitly given and are subject to predefined interval bounds. Moreover, the unit costs are known for the edge capacity building, and the total costs are constrained by the available budget. The building costs, however, are subject to uncertainty and may vary by predefined deviations, too. We intend to propose an efficient network capacity design that respects all objectives (one of which is always maximising the network flow from source to terminal vertex) and a given budget. The proposed design is robust to cost changes under a given degree of uncertainty provided by a decision-maker. We take advantage of the DeNovo optimisation framework and $Gamma$-robustness principles. We compare our approach with classic multiobjective optimisation techniques through numerical experiments on an artificial example. It occurs that none of the approaches is superior to the others in a multiobjective sense, but the one we propose yields somewhat better results in average efficiency score.

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 18th International Symposium on OPERATIONAL RESEARCH in Slovenia SOR '25

ISBN

978-961-6165-64-8

ISSN

—

e-ISSN

—

Number of pages

4

Pages from-to

387-390

Publisher name

Slovenian Society INFORMATIKA

Place of publication

Bled

Event location

Bled

Event date

Jan 1, 2025

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—