COMBINATORIAL OPTIMIZATION BY STOCHASTIC-EVOLUTION

被引：50

作者：

SAAB, YG

RAO, VB

机构：

[1] Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1991年 / 10卷 / 04期

关键词：

D O I：

10.1109/43.75636

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We introduce a new technique called stochastic evolution (SE) for solving a wide range of combinatorial optimization problems. We show that SE can be specifically tailored to solve the NETWORK BISECTION, TRAVELING SALESMAN, and the standard cell placement problems. Experimental results for these problems show that SE can produce better quality solutions than sophisticated simulated annealing (SA) based heuristics in a much shorter computation time.

引用

页码：525 / 535

页数：11

共 33 条

[1]

ARUN KS, 1986, 20TH P AS C SIGN SYS

[2] AN ALGORITHM FOR PARTITIONING THE NODES OF A GRAPH [J].

BARNES, ER .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :541-550

[3]

BLANKS JP, 1985, 21ST P DES AUT C, P602

[4]

BREUER MA, 1977, J DES AUTOM FAULT, V1, P343

[5]

Bui T., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P181

[6]

CHENG CK, 1984, IEEE T COMPUTER AIDE

[7]

COHOON JP, 1986, P IEEE INT C COMPUTE, P422

[8]

CONNORS DP, 1987, 26TH P C DEC CONTR, P2261

[9]

DUNHAM B, 1963, SYNTHESE, P254

[10] A PROCEDURE FOR PLACEMENT OF STANDARD-CELL VLSI CIRCUITS [J].

DUNLOP, AE ;

KERNIGHAN, BW .

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (01) :92-98

← 1 2 3 4 →