DocumentCode :
2759193
Title :
Stochastic evolution: a fast effective heuristic for some generic layout problems
Author :
Saab, Youssef G. ; Rao, Vasant B.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fYear :
1990
fDate :
24-28 Jun 1990
Firstpage :
26
Lastpage :
31
Abstract :
There are two canonical optimization problems, network bisectioning (NB) and traveling salesman (TS), that emerge from the physical design and layout of integrated circuits. An analogy is used between iterative techniques for combinatorial optimization and the evolution of biological species to obtain the stochastic evolution (SE) heuristic for solving a wide range of combinatorial optimization problems. It is shown that SE can be specifically tailored to solve both NB and TS. Experimental results for the NB and TS problems show that the SE algorithm produces better quality solutions and is faster than the simulated annealing algorithm in all instances considered
Keywords :
circuit layout CAD; evolution (biological); optimisation; stochastic processes; SE algorithm; canonical optimization problems; combinatorial optimization; network bisectioning; stochastic evolution heuristic; traveling salesman; Annealing; Character generation; Cost function; Design optimization; Evolution (biology); Integrated circuit layout; Iterative algorithms; Niobium; Optimization methods; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1990. Proceedings., 27th ACM/IEEE
Conference_Location :
Orlando, FL
ISSN :
0738-100X
Print_ISBN :
0-89791-363-9
Type :
conf
DOI :
10.1109/DAC.1990.114823
Filename :
114823
Link To Document :
بازگشت