Finding investigator tours in telecommunication networks using genetic algorithms
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright · 1996
We review and analyze a formal problem of fault detection in point to point telecommunications networks that are modeled as undirected graphs. Two heuristics, one deterministic and the other an application of genetic algorithm techniques, are tested on several sample graphs. The performance of these heuristics is compared and interpreted. The genetic algorithm technique consistently outperforms the deterministic technique on our test data sets.