Approximating the Pareto front of a bi-objective problem in telecommunication networks using a co-evolutionary algorithm

• Published in: Wireless networks Vol. 26; no. 7; pp. 4881 - 4893
• Main Authors: Camacho-Vallejo, José-Fernando, Garcia-Reyes, Cristóbal
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.10.2020; Springer Nature B.V
• Subjects: Approximation; Communications Engineering; Computer Communication Networks; Computing time; Convexity; Electrical Engineering; Engineering; Evolutionary algorithms; Experimentation; Genetic algorithms; Hubs; IT in Business; Mathematical programming; Networks; Operators (mathematics); Populations; Wireless networks; Telecommunication networks; Pareto front; Steiner problems; Bi-objective programming; Co-evolutionary algorithms
• ISSN: 1022-0038; 1572-8196
• DOI: 10.1007/s11276-018-01921-4

This paper studies a telecommunication network design problem. In this network, users must be connected to capacitated hubs. Then, hubs that concentrate users must be connected to each other and possibly to other hubs with no users. The connections in the network must lead to a tree topology. Hence, connection between hubs can be considered as looking for forming a Steiner tree. This problem is modeled as a bi-objective mathematical programming problem. One objective function minimizes user’s latency with respect to the information packages flowing through the capacitated hubs, and the other objective function aims the minimization of the total network’s connection cost. To approximate the Pareto front of this bi-objective problem, a co-evolutionary algorithm is developed. In the proposed algorithm, two populations are considered. Each population is associated with one objective function. The co-evolutionary operator consists of an information exchange between both populations that occurs after the genetic operators have been applied. As a result of this co-evolutionary operator, the non-dominated solutions are identified. Computational experimentation shows that the approximated Pareto fronts are representative despite their non-convexity, and they contain a sufficient number of non-dominated solutions over the tested instances. Also, the k th distance among non-dominated solutions is relatively small, which indicates that the approximated Pareto fronts are dense. Furthermore, the required computational time is very small for a problem with the characteristics herein considered.