https://scholars.lib.ntu.edu.tw/handle/123456789/119488
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Yang, J. M | en |
dc.contributor.author | CHIH-JEN LIN | en |
dc.contributor.author | Kao, C. Y. | en |
dc.creator | Yang, J. M; Lin, C. J.; Kao, C. Y. | en |
dc.date | 2003 | en |
dc.date.accessioned | 2010-12-27T09:18:59Z | - |
dc.date.accessioned | 2018-07-05T02:29:02Z | - |
dc.date.available | 2010-12-27T09:18:59Z | - |
dc.date.available | 2018-07-05T02:29:02Z | - |
dc.date.issued | 2003 | - |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/221386 | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036752160&doi=10.1080%2f03052150214019&partnerID=40&md5=585e37f22ae48de1b8d0963fc24c0bee | - |
dc.description.abstract | This paper studies an evolutionary algorithm for global optimization. Based on family competition and adaptive rules, the proposed approach consists of global and local strategies by integrating decreasing-based mutations and self-adaptive mutations. The proposed approach is experimentally analyzed by showing that its components can integrate with one another and possess good local and global properties. Following the description of implementation details, the approach is then applied to several widely used test sets, including problems from international contests on evolutionary optimization. Numerical results indicate that the new approach performs very robustly and is competitive with other well-known evolutionary algorithms. | - |
dc.language.iso | en_US | - |
dc.relation | Engineering Optimization, vol.34(5), pp.405-427, 2002 | en |
dc.relation.ispartof | Engineering Optimization | en_US |
dc.subject | Adaptive rules; Evolutionary algorithms; Family competition; Global optimization; Multiple mutation operators | - |
dc.subject.other | Evolutionary algorithms; Functions; Mathematical operators; Problem solving; Set theory; Adaptive rules; Family competition; Multiple mutation operators; Global optimization | - |
dc.title | A robust evolutionary algorithm for global optimization | en |
dc.type | journal article | en |
dc.identifier.doi | 10.1080/03052150214019 | - |
dc.identifier.scopus | 2-s2.0-0036752160 | - |
dc.relation.pages | 405-427 | - |
dc.relation.journalvolume | 34 | - |
dc.relation.journalissue | 5 | - |
item.openairetype | journal article | - |
item.fulltext | no fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en_US | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Networking and Multimedia | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Industrial Engineering | - |
crisitem.author.dept | Center for Artificial Intelligence and Advanced Robotics | - |
crisitem.author.orcid | 0000-0003-4684-8747 | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Engineering | - |
crisitem.author.parentorg | Others: University-Level Research Centers | - |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。