{"id":"https://openalex.org/W1480456514","doi":"https://doi.org/10.1109/cec.2005.1554932","title":"Efficiently Minimizing Expensive Cost Functions with a Hybrid Evolutionary Algorithm Using Clustering and a Derivative-free Optimizer: Preliminary Results","display_name":"Efficiently Minimizing Expensive Cost Functions with a Hybrid Evolutionary Algorithm Using Clustering and a Derivative-free Optimizer: Preliminary Results","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1480456514","doi":"https://doi.org/10.1109/cec.2005.1554932","mag":"1480456514"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554932","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5035132865","display_name":"Yoel Tenne","orcid":null},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Y. Tenne","raw_affiliation_strings":["School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW, Australia","Sch. of Aerosp. Mech. & Mechatronic Eng., Sydney Univ., NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"Sch. of Aerosp. Mech. & Mechatronic Eng., Sydney Univ., NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091443999","display_name":"S.W. Armfield","orcid":"https://orcid.org/0000-0002-8032-0017"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"S.W. Armfield","raw_affiliation_strings":["School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW, Australia","Sch. of Aerosp. Mech. & Mechatronic Eng., Sydney Univ., NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"Sch. of Aerosp. Mech. & Mechatronic Eng., Sydney Univ., NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4594,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72510657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"1937","last_page":"1944"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9979000091552734,"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/algorithm","display_name":"Algorithm","score":0.6654557585716248},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6340770125389099},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5942751169204712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.550180196762085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5388438701629639},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5297601819038391},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.49257808923721313},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4710618853569031},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46122533082962036},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.44891107082366943},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4234568774700165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35253453254699707},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15710225701332092}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6654557585716248},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6340770125389099},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5942751169204712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.550180196762085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5388438701629639},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5297601819038391},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.49257808923721313},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4710618853569031},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46122533082962036},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.44891107082366943},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4234568774700165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35253453254699707},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15710225701332092},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554932","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W123765585","https://openalex.org/W147998453","https://openalex.org/W1481623510","https://openalex.org/W1491103246","https://openalex.org/W1572352511","https://openalex.org/W1781059203","https://openalex.org/W1787544972","https://openalex.org/W1966878414","https://openalex.org/W2011620716","https://openalex.org/W2038527926","https://openalex.org/W2056603712","https://openalex.org/W2057202540","https://openalex.org/W2062926156","https://openalex.org/W2075184363","https://openalex.org/W2097571405","https://openalex.org/W2135038320","https://openalex.org/W2163913714","https://openalex.org/W2264065105","https://openalex.org/W2317988884","https://openalex.org/W2485879720","https://openalex.org/W2502655619","https://openalex.org/W4236478587","https://openalex.org/W4254772338","https://openalex.org/W4300939951","https://openalex.org/W4301173492","https://openalex.org/W6605119337"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875","https://openalex.org/W2802808995","https://openalex.org/W2787833928"],"abstract_inverted_index":{"A":[0],"novel":[1],"hybrid":[2,33,53,75,127,193],"algorithm":[3,42,54,81,117,203],"is":[4,19,24],"presented":[5],"to":[6,61,69,78,83,93,209],"efficiently":[7],"locate":[8,210],"the":[9,27,59,63,115,126,150,159,163,170,177,187,192,200],"global":[10,96],"minimum":[11],"of":[12,65,132,165],"a":[13,38,44,48,84,104,107,129,138,215],"function":[14,17,28,66,166],"where":[15],"each":[16],"evaluation":[18],"expensive":[20],"and":[21,43,68,82,106,135,153,181,205],"no":[22],"expression":[23],"available":[25],"for":[26,149,158],"nor":[29],"its":[30,71],"derivatives.":[31],"The":[32,52,74,99],"employs":[34],"an":[35,79,123,184],"evolutionary":[36,80,116,202],"algorithm,":[37],"density":[39],"cluster":[40],"analysis":[41],"derivate-free":[45],"optimizer":[46,87,173],"in":[47,186,214],"multi-level":[49],"hierarchical":[50],"structure.":[51],"utilizes":[55],"information":[56],"generated":[57],"during":[58],"minimization":[60,97,133],"reduce":[62],"number":[64,164],"evaluations":[67,167],"improve":[70],"domain":[72,152,188],"exploration.":[73],"was":[76,142,174,194,207],"compared":[77],"multi-start":[85,171],"derivative-free":[86,172],"since":[88,197],"both":[89],"are":[90],"candidate":[91],"algorithms":[92,100],"handle":[94],"this":[95],"problem.":[98],"were":[101],"tested":[102],"using":[103],"small":[105,151],"large":[108,160],"domain.":[109,161,217],"Test":[110],"results":[111],"showed":[112],"that":[113],"while":[114],"did":[118],"not":[119,195],"progress":[120],"much":[121],"after":[122],"initial":[124,178],"phase":[125,204],"maintained":[128],"high":[130],"rate":[131],"throughout":[134],"accordingly":[136,182],"provided":[137],"final":[139],"result":[140],"which":[141],"on":[143],"average":[144],"O(10/sup":[145,154],"6/)":[146],"more":[147,156],"accurate":[148,157],"8/)":[155],"Furthermore,":[162],"required":[168],"by":[169,176,183],"affected":[175,196],"random":[179],"population":[180],"increase":[185],"size.":[189],"In":[190],"contrast":[191],"it":[198],"employed":[199],"explorative":[201],"thus":[206],"able":[208],"better":[211],"starting":[212],"nodes":[213],"larger":[216]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
