.png){kind=icon}
Return
Recent network design techniques using evolutionary algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2004.05.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2005 Published by Elsevier B.V.
Keywords:
genetic algorithm (GA)
network design
minimum spanning tree
fixed charge transportation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
8.0K
Citations:
3.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more