{"id":"https://openalex.org/W2161148706","doi":"https://doi.org/10.1109/tcsi.2005.846216","title":"A hybrid evolutionary programming method for circuit optimization","display_name":"A hybrid evolutionary programming method for circuit optimization","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W2161148706","doi":"https://doi.org/10.1109/tcsi.2005.846216","mag":"2161148706"},"language":"en","primary_location":{"id":"doi:10.1109/tcsi.2005.846216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsi.2005.846216","pdf_url":null,"source":{"id":"https://openalex.org/S4210171352","display_name":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","issn_l":"1057-7122","issn":["1057-7122","1558-1268"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems I: Regular Papers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034578218","display_name":"N. Damavandi","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. Damavandi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113855785","display_name":"S. Safavi\u2010Naeini","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Safavi-Naeini","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":2.2771,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.90012655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"52","issue":"5","first_page":"902","last_page":"910"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-programming","display_name":"Evolutionary programming","score":0.5890551209449768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5281324982643127},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.451058954000473},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.4322143495082855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36357319355010986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29570797085762024},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1503513753414154}],"concepts":[{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.5890551209449768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5281324982643127},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.451058954000473},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.4322143495082855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36357319355010986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29570797085762024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1503513753414154}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcsi.2005.846216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsi.2005.846216","pdf_url":null,"source":{"id":"https://openalex.org/S4210171352","display_name":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","issn_l":"1057-7122","issn":["1057-7122","1558-1268"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems I: Regular Papers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1508306123","https://openalex.org/W1559956479","https://openalex.org/W1572960541","https://openalex.org/W1585335425","https://openalex.org/W1603639300","https://openalex.org/W1614056932","https://openalex.org/W1639032689","https://openalex.org/W1822013673","https://openalex.org/W1829473865","https://openalex.org/W1892411499","https://openalex.org/W1978970913","https://openalex.org/W1997958976","https://openalex.org/W2011620716","https://openalex.org/W2055468379","https://openalex.org/W2100004430","https://openalex.org/W2102248717","https://openalex.org/W2111200187","https://openalex.org/W2125715676","https://openalex.org/W2126926002","https://openalex.org/W2133548166","https://openalex.org/W2141426250","https://openalex.org/W2155199877","https://openalex.org/W2156780924","https://openalex.org/W2284330674","https://openalex.org/W2610216665","https://openalex.org/W3023540311","https://openalex.org/W4243451821","https://openalex.org/W4300515658","https://openalex.org/W6634239536","https://openalex.org/W6638452207","https://openalex.org/W6678845729"],"related_works":["https://openalex.org/W2542354426","https://openalex.org/W2545494728","https://openalex.org/W2546939201","https://openalex.org/W2547848286","https://openalex.org/W2120170501","https://openalex.org/W1601823105","https://openalex.org/W2035175584","https://openalex.org/W2121959022","https://openalex.org/W1911744185","https://openalex.org/W2109357091"],"abstract_inverted_index":{"A":[0],"hybrid":[1,112],"evolutionary":[2],"programming":[3],"(EP)":[4],"method":[5,83],"is":[6,17,60,77,91],"presented":[7],"for":[8,30],"global":[9,161],"optimization":[10,34,138,162],"of":[11,27,43,73,96,137,163],"complex":[12,31,165],"circuits.":[13],"The":[14,36,57,88,111,146],"conventional":[15],"EP":[16,37,76],"integrated":[18],"with":[19,79],"a":[20,51,80,156,164],"clustering":[21,58],"algorithm":[22,29,59,113,147],"to":[23,62,69,102],"improve":[24,70],"the":[25,28,41,44,71,75,94,104,107,117,122,125,135,141],"robustness":[26],"multimodal":[32],"circuit":[33],"problems.":[35],"generates":[38],"populations":[39],"around":[40],"regions":[42,65],"search":[45,82,90,118,123],"space":[46,119],"which":[47],"can":[48,114],"potentially":[49],"contain":[50],"minimum":[52,105],"but":[53],"may":[54],"be":[55],"overlooked.":[56],"used":[61],"identify":[63],"these":[64],"dynamically.":[66],"In":[67],"order":[68,101],"speed":[72,136],"optimization,":[74],"combined":[78],"gradient-based":[81],"in":[84,100,106,124,151],"an":[85],"efficient":[86],"fashion.":[87],"local":[89],"performed":[92,148],"from":[93],"center":[95],"each":[97],"identified":[98],"cluster":[99],"find":[103],"region":[108],"very":[109,149],"fast.":[110],"also":[115],"reduce":[116],"by":[120],"avoiding":[121],"areas":[126],"that":[127],"were":[128],"previously":[129],"investigated.":[130],"This":[131],"feature":[132],"greatly":[133],"improves":[134],"and":[139,160],"prevents":[140],"premature":[142],"convergence":[143],"as":[144],"well.":[145],"well":[150],"several":[152],"benchmark":[153],"problems":[154],"including":[155],"test":[157],"function":[158],"minimization":[159],"RF":[166],"diplexer":[167],"circuit.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}