Combinatorial optimization by stochastic evolution
- 1 April 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 10 (4) , 525-535
- https://doi.org/10.1109/43.75636
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
This publication has 27 references indexed in Scilit:
- Simulated annealing: a fast heuristic for some generic layout problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear ordering by stochastic evolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- ESp: Placement by simulated evolutionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- An algorithm for quadrisection and its application to standard cell placementIEEE Transactions on Circuits and Systems, 1988
- The TimberWolf placement and routing packageIEEE Journal of Solid-State Circuits, 1985
- Near-optimal placement using a quadratic objective functionPublished by Association for Computing Machinery (ACM) ,1985
- Module Placement Based on Resistive Network OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Linear Ordering and Application to PlacementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982