TY - GEN
A1 - Przewoźniczek, Michał
A1 - Walkowiak, Krzysztof
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event.
N2 - Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main novelty of this work is that the proposed evolutionary algorithm consists of two levels. The "high" level applies typical EA operators.
N2 - The "low" level is based on the idea of a hierarchical algorithm. However, the presented approach is not a classical hierarchical algorithm. Therefore, we call the algorithm quasi-hierarchical. We present its description and the results of simulation runs over various networks.
L1 - http://zbc.uz.zgora.pl/Content/57554/AMCS_2006_16_4_6.pdf
L2 - http://zbc.uz.zgora.pl/Content/57554
KW - evolution algorithm
KW - optimization
KW - connection-oriented networks
T1 - Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
UR - http://zbc.uz.zgora.pl/dlibra/docmetadata?id=57554
ER -