A Novel Genetic Algorithm-Based Methodology for Large-Scale Fixed Charge Plus Routing Network Design Problem With Efficient Operators

• Main Authors: Samira Doostie, Tetsuhei Nakashima-Paniagua, John Doucette
• Format: Article
• Language: English
• Published: IEEE 2021-01-01
• Series: IEEE Access
• Subjects: Genetic algorithm; large-scale network; optimal topology; routing
• Online Access: https://ieeexplore.ieee.org/document/9515310/

In this paper, we present a novel approach that addresses the problem of large-scale network topology design and routing. There are research works that used exact methodologies based on Integer Linear Programming (ILP) models to develop potential solutions for this problem. However, this problem is computationally NP-hard, thus solving it is hugely demanding on computational power for large-scale networks, and in many cases, it is not even possible to generate a solution with a reasonable optimality gap. This paper presents a hybrid algorithm based on the Genetic Algorithm with efficiently designed genetic operators. This algorithm aims to design the topology of large-scale networks and generate a routing configuration for a set of predefined traffic demands on the networks while keeping the total cost of design and routing at a minimum. The results have been compared to an exact ILP model, a relaxed ILP model, and a customized GA as benchmarks for validation purposes. These comparisons showed that the proposed algorithm significantly outperforms the ILP solutions in all of the large-scale network configurations that were used as case studies.