Recent network design techniques using evolutionary algorithms
Recent network design techniques using evolutionary algorithms
复制标题
DOI：
10.1016/j.ijpe.2004.05.026
复制
发表时间：
2005-11
影响因子：
12
通讯作者：
M. Gen;Anup Kumar;Jong Ryul Kim
中科院分区：
文献类型：
--
作者：
M. Gen;Anup Kumar;Jong Ryul Kim
随着基于计算机网络的社会系统越来越复杂，网络系统的优化问题已经引起了许多相关研究者的关注。近年来，遗传算法在组合优化、多目标优化等相关研究领域取得了很大进展。在本文中，我们考虑混合GAs（称为基于生成树的GAs）来解决工业工程和计算机通信网络中固有的难以解决的网络设计问题，如程度约束的最小生成树问题，有能力的最小生成树问题，固定电荷传输问题，网络拓扑设计问题等。
As social systems based on computer networks are more complicated, the optimization problems in network systems have been drawing the attention of many related researchers. Recently, genetic algorithms (GAs) have achieved a great advancement in related research fields, such as combinatorial optimization, multiobjective optimization, and so on. In this paper, we consider hybrid GAs (called spanning tree-based GAs) for difficult-to-solve network design problems inherent in industrial engineering and computer communication networks, such as degree-constrained minimum spanning tree problems, capacitated minimum spanning tree problems, fixed charge transportation problems, network topological design problems, and so on.