{"id":"https://openalex.org/W2074613643","doi":"https://doi.org/10.1109/icnc.2010.5584125","title":"Estimating the runtime of evolutionary programming based on uniform mutation","display_name":"Estimating the runtime of evolutionary programming based on uniform mutation","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2074613643","doi":"https://doi.org/10.1109/icnc.2010.5584125","mag":"2074613643"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5584125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584125","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural 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/A5078991585","display_name":"Zhongming Yang","orcid":"https://orcid.org/0000-0002-2146-5021"},"institutions":[{"id":"https://openalex.org/I146071755","display_name":"Kunming University","ror":"https://ror.org/035rhx828","country_code":"CN","type":"education","lineage":["https://openalex.org/I146071755"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhongming Yang","raw_affiliation_strings":["Center of Information and Network, Maoming University, Maoming, Guangdong, China"],"affiliations":[{"raw_affiliation_string":"Center of Information and Network, Maoming University, Maoming, Guangdong, China","institution_ids":["https://openalex.org/I146071755"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088160732","display_name":"Han Huang","orcid":"https://orcid.org/0009-0002-7069-0468"},"institutions":[{"id":"https://openalex.org/I90610280","display_name":"South China University of Technology","ror":"https://ror.org/0530pts50","country_code":"CN","type":"education","lineage":["https://openalex.org/I90610280"]},{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Han Huang","raw_affiliation_strings":["Department of Management Sciences, College of Business, City University of Hong Kong, Hong Kong, China","School of Software Engineering, South China University of Technology, Guangzhou, China","State Key Laboratory of Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, College of Business, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"School of Software Engineering, South China University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I90610280"]},{"raw_affiliation_string":"State Key Laboratory of Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078991585"],"corresponding_institution_ids":["https://openalex.org/I146071755"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22991777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":null,"first_page":"2338","last_page":"2342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9995999932289124,"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.8508247137069702},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5864275693893433},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5740116834640503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5475675463676453},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5179480910301208},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.5063565969467163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4982481002807617},{"id":"https://openalex.org/keywords/lebesgue-measure","display_name":"Lebesgue measure","score":0.4972997009754181},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4874267876148224},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4848093092441559},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.463259756565094},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4601157307624817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4159241318702698},{"id":"https://openalex.org/keywords/lebesgue-integration","display_name":"Lebesgue integration","score":0.22807422280311584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16564583778381348},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12579160928726196},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07022380828857422}],"concepts":[{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.8508247137069702},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5864275693893433},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5740116834640503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5475675463676453},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5179480910301208},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5063565969467163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4982481002807617},{"id":"https://openalex.org/C2777105136","wikidata":"https://www.wikidata.org/wiki/Q827230","display_name":"Lebesgue measure","level":3,"score":0.4972997009754181},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4874267876148224},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4848093092441559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.463259756565094},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4601157307624817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4159241318702698},{"id":"https://openalex.org/C14158598","wikidata":"https://www.wikidata.org/wiki/Q853831","display_name":"Lebesgue integration","level":2,"score":0.22807422280311584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16564583778381348},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12579160928726196},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07022380828857422},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5584125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584125","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural 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":21,"referenced_works":["https://openalex.org/W119114865","https://openalex.org/W153832914","https://openalex.org/W1497256448","https://openalex.org/W1514875444","https://openalex.org/W1997600725","https://openalex.org/W2020009149","https://openalex.org/W2044026582","https://openalex.org/W2084149434","https://openalex.org/W2086717587","https://openalex.org/W2102635079","https://openalex.org/W2102660810","https://openalex.org/W2144636407","https://openalex.org/W2152325608","https://openalex.org/W2154741854","https://openalex.org/W2162145193","https://openalex.org/W2166115457","https://openalex.org/W2171246116","https://openalex.org/W2171585862","https://openalex.org/W3006183383","https://openalex.org/W6683006574","https://openalex.org/W6996966676"],"related_works":["https://openalex.org/W4286907618","https://openalex.org/W2946122523","https://openalex.org/W2964623233","https://openalex.org/W2360796629","https://openalex.org/W2379651310","https://openalex.org/W2912709981","https://openalex.org/W2113019827","https://openalex.org/W2092320316","https://openalex.org/W1541249122","https://openalex.org/W4206299005"],"abstract_inverted_index":{"Although":[0],"several":[1],"studies":[2],"of":[3,10,23,40,52,82,105,111,137],"running":[4,38,53,80],"time":[5,39,57,61,81,110],"for":[6,21,36,77],"evolutionary":[7,27],"algorithm":[8],"(EA)":[9],"discrete":[11],"optimization":[12,25],"have":[13],"been":[14],"proposed,":[15],"there":[16],"are":[17,123],"few":[18],"homologous":[19],"results":[20],"EA":[22],"continuous":[24],"like":[26],"programming.":[28],"This":[29],"paper":[30,72],"presents":[31],"a":[32,74,102],"preliminary":[33],"analysis":[34],"result":[35],"the":[37,50,59,68,79,92,106,120,134,138],"an":[41,86,98],"EP":[42,63,83],"algorithms":[43],"based":[44,84],"on":[45,85],"Uniform":[46,112],"Mutation.":[47],"Defined":[48],"as":[49],"measurement":[51],"time,":[54],"first":[55,108],"hitting":[56,109],"is":[58,94],"iteration":[60],"which":[62],"spends":[64],"in":[65,67],"converging":[66],"optimal.":[69],"Hence,":[70],"this":[71],"proposes":[73],"first-hitting-time":[75],"framework":[76,93],"estimating":[78],"absorbing":[87],"Markov":[88],"process":[89],"model.":[90],"Later,":[91],"used":[95],"to":[96],"calculate":[97],"upper":[99,121],"bound":[100,104],"and":[101,133],"lower":[103],"mean":[107],"Mutation":[113],"EP.":[114],"It":[115],"can":[116],"be":[117],"indicated":[118],"that":[119],"bounds":[122],"influenced":[124],"directly":[125],"by":[126],"population":[127],"size,":[128,130],"problem":[129],"searching":[131],"range":[132],"Lebesgue":[135],"measure":[136],"optimal":[139],"\u03b5":[140],"neighborhood.":[141]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}