Solution of a 200-node p-cycle network design problem with GA-based pre-selection of candidate structures

Authors:
Diane Prisca Onguetou;Wayne D. Grover
Affiliations:
Electrical and Computer Engineering Department, University of Alberta and TRLabs, Edmonton, AB, Canada;Electrical and Computer Engineering Department, University of Alberta and TRLabs, Edmonton, AB, Canada
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 1
Cited 1

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Altering grooming decisions to enhance p-cycle design efficiency

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a research challenge we have sought to create and solve p-cycle network design problems involving 200 or more nodes. At such problems sizes, the space of all simple cycle structures on the network graph cannot even be known in practice, let alone put into a conventional ILP problem instance. The approach being taken is a combination of GA methods with ILP; GA is guided by a subsidiary ILP surrogate problem to preselect a set of collectively high merit candidate cycles to populate a size-reduced final fully detailed ILP. Feasible solutions of high quality have been obtained for an initial 200- node test case. Comparison of the result by other workers is invited.