Optimizing the routing of optical distribution points on a fiber network using modified genetic algorithm (GA’s) with a travelling salesman problem approach

• Main Authors: Auliya, Yudha Alif, Prihandoko, Antonius Cahya, Retnani, Diah Ayu, Ruhminat, Qurrota A’Yuni Ar, Zarkasi, Mohammad, Firmansyah, Diksi Media, Slamin
• Format: Conference Proceeding
• Language: English
• Subjects: Bit error rate; Budgets; Error analysis; Genetic algorithms; Optimization; Traveling salesman problem
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0222824

Gili Ketapang requires Island sufficient information and communication technology support to accommodate the increasing development of tourism projects. This study builds upon prior research focused on the development of the Fiber to The Home (FTTH) model. The positioning and establishment of the ODP line are crucial as they impact the network’s cost and efficiency. ODP path optimization employs the methodology of the traveling salesman problem to determine the most efficient route with the minimum distance. This study employed a modified genetic algorithm approach to identify the most optimal ODP route. The test results indicate that the optimal route for the optical distribution point (ODP) is located at coordinates 3,807,477 in the Cartesian system. The route’s fitness is 0.000263. The optimal results for the route test were achieved with a population size of 100 and a mutation probability of 0.005. The ODP utilized is derived from the count of household heads on Gili Ketapang island, employing a splitter distribution ratio of 1:16. This simulation analyzes the parameters of the power link budget, rise time budget, and bit error rate (BER). The downlink architecture yielded a Max Q Factor value of 7.83625, while the uplink architecture resulted in a value of 9.75789.