A GENETIC APPROACH FOR NETWORK PARTITIONING

被引:4
作者
JIN, LM
CHAN, SP
机构
[1] Circuits and Systems Research Laboratory, School of Engineering, Santa Clara University, Santa Clara
关键词
PARTITIONING; DISCRETE OPTIMIZATION; NP-COMPLETE PROBLEMS; GENETIC ALGORITHMS;
D O I
10.1080/00207169208804049
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A new partitioning algorithm, genetic partitioning, utilizing genetic algorithms is presented. The genetic partitioning has the abilities of climbing uphill with respect to the best solution, and of implicit parallel processing due to its population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in performance, as verified by the second circuit. © 1992, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码:47 / 60
页数:14
相关论文
共 20 条
[1]  
[Anonymous], 1979, COMPUTERS INTRACTABI
[2]  
COHOON JP, 1986, P IEEE INT C COMPUTE, P422
[3]   ADAPTIVE SYSTEM-DESIGN - A GENETIC APPROACH [J].
DEJONG, K .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (09) :566-574
[4]  
Fiduccia C. M., 1988, PROC 19 AUTOM C, P241, DOI DOI 10.1109/DAC.1982.1585498
[5]  
Fourman M.P., 1985, P 1 INT C GENETIC AL, P141
[6]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[7]  
GOLDBERG DE, 1989, COMMUNICATION FEB
[8]  
Goldberg Jr D.E., 1985, P 1 INT C GEN ALG TH, V154, P154, DOI DOI 10.4324/9781315799674
[9]  
Grefenstette J., 1985, P 1 INT C GENETIC AL, P160
[10]   OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS [J].
GREFENSTETTE, JJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01) :122-128