KFUPM ePrints

Adaptive bias simulated evolution algorithm for placement

Youssef, H. and Sait, Sadiq M. and Ali, H. (2001) Adaptive bias simulated evolution algorithm for placement. Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 5.

[img]
Preview
PDF
18Kb
[img]Microsoft Word
26Kb

Abstract

Simulated Evolution (SE) is a general meta-heuristic for combinatorial optimization problems. A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. Because it is not possible to accurately estimate the goodness of individual elements, SE resorts to a Selection Bias parameter. This parameter has major impact on the algorithm run-time and the quality of the solution subspace searched. In this work, we propose an adaptive bias scheme which adjusts automatically to the quality of solution and makes the algorithm independent of the problem class or instance, as well as any user defined value. Experimental results on benchmark tests show major speedup while maintaining similar solution quality



Item Type:Article
Date:2001
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Youssef, H. and Sait, Sadiq M. and Ali, H.
Email:UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:14662
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:44
Last Modified:12 Apr 2011 13:16

Repository Staff Only: item control page