{"id":"https://openalex.org/W4232649480","doi":"https://doi.org/10.1504/ijmheur.2016.10001071","title":"Genetic algorithm with integrated computing budget allocation for stochastic problems","display_name":"Genetic algorithm with integrated computing budget allocation for stochastic problems","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W4232649480","doi":"https://doi.org/10.1504/ijmheur.2016.10001071"},"language":"en","primary_location":{"id":"doi:10.1504/ijmheur.2016.10001071","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10001071","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","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/A5077220014","display_name":"Mengmei Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mengmei Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kentucky, Lexington, KY 40506, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kentucky, Lexington, KY 40506, USA","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028818495","display_name":"Aaron M. Cramer","orcid":"https://orcid.org/0000-0003-4850-8252"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron M. Cramer","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kentucky, Lexington, KY 40506, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kentucky, Lexington, KY 40506, USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23730548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"2","first_page":"115","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.991599977016449,"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.991599977016449,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908999800682068,"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.9742000102996826,"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/computer-science","display_name":"Computer science","score":0.7620446681976318},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7317265272140503},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6642438769340515},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6178083419799805},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5407367944717407},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5244667530059814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5052199959754944},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.4425508677959442},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.43338069319725037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3859519958496094},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14228913187980652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.133384108543396},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12305682897567749}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7620446681976318},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7317265272140503},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6642438769340515},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6178083419799805},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5407367944717407},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5244667530059814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5052199959754944},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4425508677959442},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.43338069319725037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3859519958496094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14228913187980652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.133384108543396},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12305682897567749},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmheur.2016.10001071","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10001071","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2726551571","https://openalex.org/W2357619356","https://openalex.org/W2326694407","https://openalex.org/W2106492215","https://openalex.org/W2082859007","https://openalex.org/W2550292406","https://openalex.org/W1606502848","https://openalex.org/W2378719652","https://openalex.org/W2115729582","https://openalex.org/W2164831575"],"abstract_inverted_index":{"Stochastic":[0],"problems":[1],"are":[2,29,95,155],"of":[3,21,27,75,184],"great":[4],"interest":[5],"in":[6,46,53,89],"many":[7],"applications,":[8],"and":[9,50,126,162,170],"genetic":[10],"algorithms":[11],"(GAs)":[12],"have":[13,64],"been":[14],"widely":[15],"used":[16,105],"to":[17,31,48,78,113,132,182,193],"solve":[18],"these":[19],"kinds":[20],"problems.":[22,149],"Normally,":[23],"a":[24,85,166],"large":[25],"number":[26],"samples":[28,186],"needed":[30],"evaluate":[32],"the":[33,38,43,54,72,76,80,99,121,137,142,175,185,189,197],"stochastic":[34],"function":[35],"such":[36],"that":[37,174],"sample":[39],"mean":[40,45],"closely":[41],"approximates":[42],"actual":[44],"order":[47],"rank":[49],"select":[51],"accurately":[52],"GA;":[55],"however,":[56],"this":[57,127],"method":[58,129],"is":[59,87,130,172],"computationally":[60],"expensive.":[61],"Some":[62],"researchers":[63],"integrated":[65,96],"different":[66],"computing":[67,82,91,139,151],"budget":[68,92,140,152],"allocation":[69,93,153],"schemes":[70],"into":[71,98],"evaluation":[73],"procedure":[74],"GA":[77,86,192],"reduce":[79],"total":[81],"cost.":[83],"Herein,":[84],"proposed":[88,190],"which":[90],"techniques":[94],"directly":[97],"selection":[100],"operator":[101],"rather":[102],"than":[103,141],"being":[104],"during":[106],"fitness":[107,111],"evaluation.":[108],"This":[109],"allows":[110],"evaluations":[112],"be":[114,133],"allocated":[115],"towards":[116],"specific":[117],"individuals":[118],"for":[119,136],"whom":[120],"algorithm":[122,178],"requires":[123],"more":[124,134],"information,":[125],"selection-integrated":[128,191],"shown":[131,173],"accurate":[135],"same":[138,198],"existing":[143,176],"evaluation-integrated":[144,177],"methods":[145,154],"on":[146,157],"several":[147],"test":[148,160],"Different":[150],"studied":[156],"both":[158],"traditional":[159],"functions":[161,164],"benchmark":[163],"from":[165],"recent":[167],"conference":[168],"competition,":[169],"it":[171],"may":[179],"require":[180],"up":[181],"225%":[183],"required":[187],"by":[188],"achieve":[194],"results":[195],"with":[196],"accuracy.":[199]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}