z-logo
open-access-imgOpen Access
Finding investigator tours in telecommunication networks using genetic algorithms
Author(s) -
Cory Hoelting,
Dale I. Schoenefeld,
Roger L. Wainwright
Publication year - 1996
Publication title -
proceedings of the 2002 acm symposium on applied computing - sac '02
Language(s) - English
Resource type - Conference proceedings
ISBN - 0-89791-820-7
DOI - 10.1145/331119.331151
Subject(s) - computer science , genetic algorithm , telecommunications , computer network , algorithm , machine learning
We review and analyze a formal problem of fault de tection in point to point telecommunications networks that are modeled as undirected graphs Two heuristics one deterministic and the other an application of ge netic algorithm techniques are tested on several sample graphs The performance of these heuristics is compared and interpreted The genetic algorithm technique con sistently outperforms the deterministic technique on our test data sets

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom