{"id":"https://openalex.org/W2511933397","doi":"https://doi.org/10.4018/ijsir.2016100102","title":"An Adaptive Population-based Simplex Method for Continuous Optimization","display_name":"An Adaptive Population-based Simplex Method for Continuous Optimization","publication_year":2016,"publication_date":"2016-08-15","ids":{"openalex":"https://openalex.org/W2511933397","doi":"https://doi.org/10.4018/ijsir.2016100102","mag":"2511933397"},"language":"en","primary_location":{"id":"doi:10.4018/ijsir.2016100102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijsir.2016100102","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","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/A5022763293","display_name":"Mahamed G. H. Omran","orcid":"https://orcid.org/0000-0002-4695-6919"},"institutions":[{"id":"https://openalex.org/I179311214","display_name":"Gulf University for Science & Technology","ror":"https://ror.org/04d9rzd67","country_code":"KW","type":"education","lineage":["https://openalex.org/I179311214"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Mahamed G.H. Omran","raw_affiliation_strings":["Department of Computer Science, Gulf University for Science and Technology, Hawally, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Gulf University for Science and Technology, Hawally, Kuwait","institution_ids":["https://openalex.org/I179311214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084308613","display_name":"Maurice Clerc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maurice Clerc","raw_affiliation_strings":["Independent Consultant, Groisy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Consultant, Groisy, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2993,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87068224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"7","issue":"4","first_page":"23","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9868999719619751,"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.9868000149726868,"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/simplex","display_name":"Simplex","score":0.8099676370620728},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7378506660461426},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6708824634552002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6657775640487671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6465434432029724},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6388565897941589},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4438523054122925},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3172147274017334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22908571362495422},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.05388742685317993}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.8099676370620728},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7378506660461426},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6708824634552002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6657775640487671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6465434432029724},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6388565897941589},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4438523054122925},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3172147274017334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22908571362495422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05388742685317993},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijsir.2016100102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijsir.2016100102","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jsir00:v:7:y:2016:i:4:p:23-51","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2016100102","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W102487131","https://openalex.org/W1547367140","https://openalex.org/W1972571116","https://openalex.org/W1975363693","https://openalex.org/W1979541769","https://openalex.org/W1986459292","https://openalex.org/W2024991751","https://openalex.org/W2025500642","https://openalex.org/W2025553185","https://openalex.org/W2028656627","https://openalex.org/W2057499839","https://openalex.org/W2069881902","https://openalex.org/W2095595785","https://openalex.org/W2102889464","https://openalex.org/W2132181343","https://openalex.org/W2134342112","https://openalex.org/W2139386984","https://openalex.org/W2155529731","https://openalex.org/W2162145193","https://openalex.org/W2169369819","https://openalex.org/W2171074980","https://openalex.org/W2543580944","https://openalex.org/W2605471592","https://openalex.org/W3023540311","https://openalex.org/W3137715965"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W2384679317","https://openalex.org/W2477407501","https://openalex.org/W1570109187","https://openalex.org/W2366013513","https://openalex.org/W3125083766","https://openalex.org/W4244786412","https://openalex.org/W2028887049","https://openalex.org/W3143155029"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,31,51,61,67,75,79,127],"new":[4],"population-based":[5],"simplex":[6],"method":[7],"for":[8],"continuous":[9],"function":[10],"optimization.":[11],"The":[12,108],"proposed":[13],"method,":[14,34],"called":[15],"Adaptive":[16],"Population-based":[17],"Simplex":[18,25,45],"(APS),":[19],"is":[20,30,64,78,83,92],"inspired":[21],"by":[22],"the":[23,37,43,71,118,122,134],"Low-Dimensional":[24],"Evolution":[26],"(LDSE)":[27],"method.":[28,46],"LDSE":[29],"recent":[32],"optimization":[33],"which":[35,54],"uses":[36,50],"reflection":[38],"and":[39,87,133],"contraction":[40],"steps":[41],"of":[42,103],"Nelder-Mead":[44],"Like":[47],"LDSE,":[48],"APS":[49,77,91,113,138],"population":[52],"from":[53],"different":[55],"simplexes":[56],"are":[57,105],"selected.":[58],"In":[59,125],"addition,":[60,126],"local":[62],"search":[63],"performed":[65],"using":[66],"hyper-sphere":[68],"generated":[69],"around":[70],"best":[72],"individual":[73],"in":[74],"simplex.":[76],"tuning-free":[80],"approach,":[81],"it":[82],"easy":[84,88],"to":[85,89],"code":[86],"understand.":[90],"compared":[93],"with":[94,142],"five":[95,102],"state-of-the-art":[96],"approaches":[97],"on":[98,121],"23":[99],"functions":[100],"where":[101],"them":[104],"quasi-real-world":[106],"problems.":[107,145],"experimental":[109],"results":[110,135],"show":[111,136],"that":[112,137],"generally":[114],"performs":[115],"better":[116],"than":[117],"other":[119],"methods":[120],"test":[123],"functions.":[124],"scalability":[128],"study":[129],"has":[130],"been":[131],"conducted":[132],"can":[139],"work":[140],"well":[141],"relatively":[143],"high-dimensional":[144]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}