Title :
Combinatorial optimization by stochastic evolution
Author :
Saab, Youssef G. ; Rao, Vasant B.
Author_Institution :
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
fDate :
4/1/1991 12:00:00 AM
Abstract :
A novel technique is introduced, called stochastic evolution (SE), for solving a wide range of combinatorial optimization problems. It is shown that SE can be specifically tailored to solve the network bisection, traveling salesman, and 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
Keywords :
circuit layout; combinatorial mathematics; optimisation; stochastic processes; combinatorial optimization problems; network bisection; standard cell placement problems; stochastic evolution; traveling salesman; Computational modeling; Convergence; Cost function; Iterative algorithms; Iterative methods; NP-complete problem; Simulated annealing; State-space methods; Stochastic processes; Traveling salesman problems;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
