Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach

The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of genetic algorithms GA for the design of a degree constrained minimal spanning tree DCMST problem with varied degrees on each node. The performance of GA was compared with two popular heuristics. The results indicate that GA provide better solution quality compared to heuristics, but is worse than heuristics in terms of computation time.

• Type: Conference
• Year: 1999
• Where: GECCO
• Authors: Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhong Sun
• Keywords: Complicated Issue, GECCO 1999, Minimal Spanning Tree, Optimization, Popular Heuristics