.png){kind=icon}
返回
A Novel Genetic Algorithm-Based Methodology for Large-Scale Fixed Charge Plus Routing Network Design Problem With Efficient Operators
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3104794.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Network topology
Routing
Topology
Genetic algorithms
Genetics
Biological cells
Mathematical model
Genetic algorithm
large-scale network
optimal topology
routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm基于改进遗传算法的连续环境多目标多机器人路径规划
PREAI
分享收藏A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem用于固定收费多商品网络流问题的并行本地搜索框架
PREAI
分享收藏A first multilevel cooperative algorithm for capacitated multicommodity network design用于容量约束的多商品网络设计的第一种多级协作算法
PREAI
分享收藏Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem非分叉跳约束多商品容量固定收费网络设计问题的公式
PREAI
分享收藏
查看更多内容