- Tytuł:
- Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
- Autorzy:
-
Przewoźniczek, M.
Walkowiak, K. - Powiązania:
- https://bibliotekanauki.pl/articles/908380.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
algorytm ewolucyjny
optymalizacja
sieć komputerowa
evolution algorithm
optimization
connection-oriented networks - Opis:
- 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. 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. 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.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 487-502
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł