Stochastic evolution: a fast effective heuristic for some generic layout problems
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A new fuzzy operator and its application to topology design of distributed local area networks
Information Sciences: an International Journal
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
IEEE Transactions on Parallel and Distributed Systems
Global search algorithm for automated maintenance planning and scheduling of parts requests
Computers and Operations Research
A robust design of simulated annealing approach for mixed-model sequencing
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
| Hi-index | 0.03 |
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