Adaptive bias simulated evolution algorithm for placement
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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2001
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14662/1/14662_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14662/2/14662_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513394246156288 |
|---|---|
| author | Youssef, H. |
| author2 | Sait, Sadiq M. Ali, H. unknown |
| author2_role | author author author |
| author_facet | Youssef, H. Sait, Sadiq M. Ali, H. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Youssef, H. Sait, Sadiq M. Ali, H. unknown |
| dc.date.none.fl_str_mv | 2001 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14662/1/14662_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14662/2/14662_2.doc (2001) Adaptive bias simulated evolution algorithm for placement. Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 5. |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14662/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Adaptive bias simulated evolution algorithm for placement |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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 |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_16aa3b160e1d80ce39641d43bb40f9ea |
| identifier_str_mv | (2001) Adaptive bias simulated evolution algorithm for placement. Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 5. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14662 |
| publishDate | 2001 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Adaptive bias simulated evolution algorithm for placementYoussef, H.Sait, Sadiq M.Ali, H.unknownComputerSimulated 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 qualityIEEE20012020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14662/1/14662_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14662/2/14662_2.doc (2001) Adaptive bias simulated evolution algorithm for placement. Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 5. enenhttps://eprints.kfupm.edu.sa/id/eprint/14662/info:eu-repo/semantics/openAccessoai::146622019-11-01T14:06:51Z |
| spellingShingle | Adaptive bias simulated evolution algorithm for placement Youssef, H. Computer |
| status_str | publishedVersion |
| title | Adaptive bias simulated evolution algorithm for placement |
| title_full | Adaptive bias simulated evolution algorithm for placement |
| title_fullStr | Adaptive bias simulated evolution algorithm for placement |
| title_full_unstemmed | Adaptive bias simulated evolution algorithm for placement |
| title_short | Adaptive bias simulated evolution algorithm for placement |
| title_sort | Adaptive bias simulated evolution algorithm for placement |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14662/1/14662_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14662/2/14662_2.doc |