An evolutionary approach for survivable network under SRLG constraints

Yueheng Sun; Jianyong Sun; Qingfu Zhang

doi:10.1109/ICNC.2009.739

An evolutionary approach for survivable network under SRLG constraints

Yueheng Sun, Jianyong Sun, Qingfu Zhang

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

In this paper, a hierarchical evolutionary approach is proposed for an -complete telecommunication problem - all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of the greedy heuristic, and thereafter to construct the optimal solution. Experimental results show that the proposed approach performs significantly better than the best-known evolutionary-based algorithm in 25 out of 30 test instances in terms of solution quality and CPU times. © 2009 IEEE.

Original language	English
Title of host publication	5th International Conference on Natural Computation, ICNC 2009
Pages	122-126
Volume	4
DOIs	https://doi.org/10.1109/ICNC.2009.739
Publication status	Published - 2009
Externally published	Yes
Event	5th International Conference on Natural Computation, ICNC 2009 - Tianjian, China Duration: 14 Aug 2009 → 16 Aug 2009

Publication series

Name
Volume	4

Conference

Conference	5th International Conference on Natural Computation, ICNC 2009
Place	China
City	Tianjian
Period	14/08/09 → 16/08/09

Access Output

10.1109/ICNC.2009.739

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{4c39079b94124ada8a131519c03a05d7,

title = "An evolutionary approach for survivable network under SRLG constraints",

abstract = "In this paper, a hierarchical evolutionary approach is proposed for an -complete telecommunication problem - all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of the greedy heuristic, and thereafter to construct the optimal solution. Experimental results show that the proposed approach performs significantly better than the best-known evolutionary-based algorithm in 25 out of 30 test instances in terms of solution quality and CPU times. {\textcopyright} 2009 IEEE.",

author = "Yueheng Sun and Jianyong Sun and Qingfu Zhang",

year = "2009",

doi = "10.1109/ICNC.2009.739",

language = "English",

isbn = "9780769537368",

volume = "4",

pages = "122--126",

booktitle = "5th International Conference on Natural Computation, ICNC 2009",

note = "5th International Conference on Natural Computation, ICNC 2009 ; Conference date: 14-08-2009 Through 16-08-2009",

}

TY - GEN

T1 - An evolutionary approach for survivable network under SRLG constraints

AU - Sun, Yueheng

AU - Sun, Jianyong

AU - Zhang, Qingfu

PY - 2009

Y1 - 2009

N2 - In this paper, a hierarchical evolutionary approach is proposed for an -complete telecommunication problem - all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of the greedy heuristic, and thereafter to construct the optimal solution. Experimental results show that the proposed approach performs significantly better than the best-known evolutionary-based algorithm in 25 out of 30 test instances in terms of solution quality and CPU times. © 2009 IEEE.

AB - In this paper, a hierarchical evolutionary approach is proposed for an -complete telecommunication problem - all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of the greedy heuristic, and thereafter to construct the optimal solution. Experimental results show that the proposed approach performs significantly better than the best-known evolutionary-based algorithm in 25 out of 30 test instances in terms of solution quality and CPU times. © 2009 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=77950592914&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77950592914&origin=recordpage

U2 - 10.1109/ICNC.2009.739

DO - 10.1109/ICNC.2009.739

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9780769537368

VL - 4

SP - 122

EP - 126

BT - 5th International Conference on Natural Computation, ICNC 2009

T2 - 5th International Conference on Natural Computation, ICNC 2009

Y2 - 14 August 2009 through 16 August 2009

ER -

An evolutionary approach for survivable network under SRLG constraints

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this