A Study on Heuristic Algorithms to construct the Local Loop Connection

Planning and constructing telecommunication networks requires designers to consider many factors, such as the type, number, position of components and the path of cables. The difficulty of producing cost-effective solutions is generally proportional to the size and complexity of a network. Several network-planning algorithms that can obtain an optimal or near optimal solution have been developed. These problems are not very straightforward, and they have taken some time to arrive at the results that are now known. The efficiency have since been improved, but not too affordable for practical networks. For this to work, we proposed two heuristic algorithms for planning local loop connection. Two suggested algorithms are implemented for the four actual regions in Korea. Finally, we compared the efficiency of the algorithms