Network design techniques using adapted genetic algorithms

被引:59
作者
Gen, M [1 ]
Cheng, RW
Oren, SS
机构
[1] Ashikaga Inst Technol, Dept Ind & Informat Syst Engn, Ashikaga 3268558, Japan
[2] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA
关键词
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;
D O I
10.1016/S0965-9978(01)00007-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:731 / 744
页数:14
相关论文
共 49 条
[1]  
[Anonymous], 1990, ALGORITHMIC GRAPH TH
[2]  
[Anonymous], 1985, INTRO AUTOMATED PROC
[3]   A COMPUTER-AIDED PROCESS PLANNING-MODEL BASED ON GENETIC ALGORITHMS [J].
AWADH, B ;
SEPEHRI, N ;
HAWALESHKA, O .
COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (08) :841-856
[4]  
Bertsekas D. P., 1992, DATA NETWORKS
[5]  
CHENG R, THESIS TOKYO I TECHN, P997
[6]  
CHENG R, 2000, P GECOO, P299
[7]   An evolution programme for the resource-constrained project scheduling problem [J].
Cheng, RW ;
Gen, M .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 1998, 11 (03) :274-287
[8]   LOCATION-ALLOCATION PROBLEMS [J].
COOPER, L .
OPERATIONS RESEARCH, 1963, 11 (03) :331-343
[9]  
Cormen T. H., 1990, INTRO ALGORITHMS
[10]  
DOMSCHKE K, 1984, INT BIBLIOGRAPHY LOC