Journal
ADVANCES IN ENGINEERING SOFTWARE
Volume 32, Issue 9, Pages 731-744Publisher
ELSEVIER SCI LTD
DOI: 10.1016/S0965-9978(01)00007-2
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
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available