In:
Symmetry, MDPI AG, Vol. 14, No. 12 ( 2022-11-29), p. 2523-
Abstract:
This article studies the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability and introduces a metaheuristic resolution approach based on Greedy Randomized Adaptive Search Procedure and Variable Neighborhood Descent. Under the hostile model, nodes and links are subject to probabilistic failures. The research focuses on studying the relationship between the optimization and the reliability evaluation in a symmetric network design problem. Relevant research questions are addressed, linking the number of feasible networks for the full probabilistic model, the sensitivity with respect to elementary probabilities of operation for both edges and nodes, and the sensitivity of the model with respect to the symmetric connectivity constraints defined for terminal nodes. The main result indicates that, for the hostile model, it is better at improving the elementary probabilities of operation of links than improving the elementary probabilities of Steiner nodes, to meet a required reliability threshold for the designed network.
Type of Medium:
Online Resource
ISSN:
2073-8994
Language:
English
Publisher:
MDPI AG
Publication Date:
2022
detail.hit.zdb_id:
2518382-5
