A new heuristic method for optical network topology optimization

This paper develops a new heuristic algorithm for optical network topology design and optimization. An optical network topology typically has a ring topology; therefore, it can be modelled with the Travelling Salesman Problem. Furthermore, solution can be obtained from the TSP's model using heuristic method and get an optimal ring topology in a quick time. The quality and result of the topology result is based on the minimum weight value. This proposed algorithm will determine the starting point or set of links that are below some value and then will grow until every node are successfully passed or visited. This algorithm's quality is tested by comparing the minimum weight value with others algorithms such as brute force algorithm, ant colony algorithm, and another related algorithm. This proposed algorithm can produce a ring topology with a minimum weight value better than ant colony algorithm and the computing time is much faster than brute force.