메뉴 건너뛰기




Volumn 3004, Issue , 2004, Pages 177-187

Designing reliable communication networks with a genetic algorithm using a repair heuristic

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; REPAIR; TELECOMMUNICATION NETWORKS;

EID: 35048883527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_18     Document Type: Article
Times cited : (8)

References (24)
  • 4
    • 20344370362 scopus 로고
    • Analysis method of survivability of probabilistic networks
    • Li Ying. Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine, 48, 1993.
    • (1993) Military Communication Technology Magazine , vol.48
    • Ying, L.1
  • 5
    • 0031223084 scopus 로고    scopus 로고
    • Local search genetic algorithm for optimal design of reliable networks
    • B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. on Evolutionary Computation, 1(3):179-188, 1997.
    • (1997) IEEE Trans. on Evolutionary Computation , vol.1 , Issue.3 , pp. 179-188
    • Dengiz, B.1    Altiparmak, F.2    Smith, A.E.3
  • 6
    • 0032156812 scopus 로고    scopus 로고
    • Topological optimization of a reliable communication network
    • Sheng-Tzong Cheng. Topological optimization of a reliable communication network. IEEE Transactions on Reliability, 47(3):225-233, 1998.
    • (1998) IEEE Transactions on Reliability , vol.47 , Issue.3 , pp. 225-233
    • Cheng, S.-T.1
  • 7
    • 0034174055 scopus 로고    scopus 로고
    • Topological optimization model for communication network with multiple reliability goals
    • Baoding Liu and K. Iwamura. Topological optimization model for communication network with multiple reliability goals. Computer and Mathematics with Applications, 39:59-69, 2000.
    • (2000) Computer and Mathematics with Applications , vol.39 , pp. 59-69
    • Liu, B.1    Iwamura, K.2
  • 8
    • 0035882233 scopus 로고    scopus 로고
    • Spanning tree approach in all-terminal network reliability expansion
    • N. Fard and Tae-Han Lee. Spanning tree approach in all-terminal network reliability expansion, computer communications, 24:1348-1353, 2001.
    • (2001) Computer Communications , vol.24 , pp. 1348-1353
    • Fard, N.1    Lee, T.-H.2
  • 9
    • 0027555824 scopus 로고
    • Topological optimization of a communication network subject to a reliability constraint
    • Rong-Hong Jan, Fung-Jen Hwang, and Sheng-Tzong Chen. Topological optimization of a communication network subject to a reliability constraint. IEEE Transactions on Reliability, 42(1):63-70, 93.
    • (1993) IEEE Transactions on Reliability , vol.42 , Issue.1 , pp. 63-70
    • Jan, R.-H.1    Hwang, F.-J.2    Chen, S.-T.3
  • 12
    • 0034174055 scopus 로고    scopus 로고
    • Topological optimization models for communication network with multiple reliability goals
    • B.Liu and K. Iwamura. Topological optimization models for communication network with multiple reliability goals. Computers and Mathematics with Applications, 39:59-69, 2000.
    • (2000) Computers and Mathematics with Applications , vol.39 , pp. 59-69
    • Liu, B.1    Iwamura, K.2
  • 13
    • 0019556403 scopus 로고
    • Reliability evaluation in computer-communication networks
    • K.K. Aggarwal and Suresg Rai. Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability, 30(1):32-35, 1981.
    • (1981) IEEE Transactions on Reliability , vol.30 , Issue.1 , pp. 32-35
    • Aggarwal, K.K.1    Rai, S.2
  • 21
    • 33845623782 scopus 로고
    • Neuer Beweis eines Satzes über Permutationen
    • H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik und Physik, 27:742-744, 1918.
    • (1918) Archiv Für Mathematik Und Physik , vol.27 , pp. 742-744
    • Prüfer, H.1
  • 22
    • 0038479945 scopus 로고    scopus 로고
    • Edge-sets: An effective evolutionary coding of spanning trees
    • Günther R. Raidl and Bryant A. Julstrom. Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation, 7(3):225-239, 2003.
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , Issue.3 , pp. 225-239
    • Raidl, G.R.1    Julstrom, B.A.2
  • 23
    • 0008297013 scopus 로고    scopus 로고
    • An improved general upperbound for all-terminal network reliability
    • University of Pittsburgh
    • A. Konak and A. Smith. An improved general upperbound for all-terminal network reliability. Technical report, University of Pittsburgh, 1998.
    • (1998) Technical Report
    • Konak, A.1    Smith, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.