.png){kind=icon}
.png){kind=icon}
Return
Network design techniques using adapted genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0965-9978(01)00007-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years we have evidenced an extensive effort in the development of computer communication networks, which have deeply integrated in human being's everyday life. One of important aspects of the network design process is the topological design problem involved in establishing a communication network, However, with the increase of the problem scale, the conventional techniques are facing the challenge to effectively and efficiently solve those complicated network design problems. In this article, we summarized recent research works on network design problems by using genetic algorithms (GAs), including multistage process planning (MPP) problem, fixed charge transportation problem (fc-TP), minimum spanning tree problem, centralized network design, local area network (LAN) design and shortest path problem. All these problems are illustrated from the point of genetic representation encoding skill and the genetic operators with hybrid strategies. Large quantities of numerical experiments show the effectiveness and efficiency of such kind of GA-based approach. (C) 2001 Elsevier Science Ltd. All rights reserved.
Keywords:
genetic algorithms
network design
multistage process planning
minimum spanning tree
fixed charge transportation problems
centralized network design
local area network design
and bicriteria shortest path problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W
Organization
No organization information available