Optimization of ring-star transmission problem in telecommunication systems based on Ant Colony algorithms
Solving complex combinatorial optimization problems using classical algorithms is not efficient related to resources and time. To overcome the problem, we used optimal parameters selection based on Ant Colony Optimization (ACO) algorithms. In this paper, we present algorithm for solving telecommunication network using ACO for searching optimal ring star network topology. We analyzed ant's optimization ability based on shortest path between the nest and food location. In our research we used: Ant System, Elitist Ant System, Rank-Based Ant System, and MAX-MIN Ant System. The program is developed using GNU C++ to prove the algorithm theoretical convergence through simulation on variety of topologies regarding to node numbers. The algorithm was adapted to solve design of telecommunication network, which connects terminals to concentrators using point-to-point connections. The algorithm's output is a star topology showing connections of concentrators in a ring creating Digital Data Service. Algorithm uses seventeen parameters, with thirteen metrics to evaluate configurations. Program validation is performed using three different network node configurations for all four ACO algorithms, only changing two control parameters: speed of pheromone evaporation and existence of local search. The best path was evaluated based on: total time, number of iterations, ring size, and value of topology.