In recent years we have evidenced an extensive effort in the development of
computer communication networks, which have deeply integrated in human bei
ng'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 th
ose complicated network design problems. In this article, we summarized rec
ent research works on network design problems by using genetic algorithms (
GAs), including multistage process planning (MPP) problem, fixed charge tra
nsportation problem (fc-TP), minimum spanning tree problem, centralized net
work design, local area network (LAN) design and shortest path problem. All
these problems are illustrated from the point of genetic representation en
coding skill and the genetic operators with hybrid strategies. Large quanti
ties of numerical experiments show the effectiveness and efficiency of such
kind of GA-based approach. (C) 2001 Elsevier Science Ltd. All rights reser
ved.