On implementing Chordal ring structures using Genetic Algorithm and Simulated Annealing

The paper presents an implementation analysis of Chordal ring structures using two modern heuristics namely Simulated Annealing and Genetic Algorithm. In recent years Chordal rings gained a lot of interest for physical topology of the next generation large-scale network infrastructure. Degree 3 Chordal ring structures possess small diameters, low average distances and easy routing schemes. For the implementation a case study of North Jutland has been considered as a test subject. When comparing the performance among the two employed heuristics, in our case, simulated annealing algorithm performs much better in an approximately equal run time. But if the run time is little more allowed then genetic algorithms tends to performs better.