{"id":"https://openalex.org/W2111477207","doi":"https://doi.org/10.1155/2012/540861","title":"A Novel Approach to Improve the Performance of Evolutionary Methods for Nonlinear Constrained Optimization","display_name":"A Novel Approach to Improve the Performance of Evolutionary Methods for Nonlinear Constrained Optimization","publication_year":2012,"publication_date":"2012-08-26","ids":{"openalex":"https://openalex.org/W2111477207","doi":"https://doi.org/10.1155/2012/540861","mag":"2111477207"},"language":"en","primary_location":{"id":"doi:10.1155/2012/540861","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2012/540861","pdf_url":"https://downloads.hindawi.com/archive/2012/540861.pdf","source":{"id":"https://openalex.org/S2788495","display_name":"Advances in Artificial Intelligence","issn_l":"1687-7470","issn":["1687-7470","1687-7489"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/archive/2012/540861.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alireza Rowhanimanesh","orcid":"https://orcid.org/0000-0001-8477-0747"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Rowhanimanesh","raw_affiliation_strings":["Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, Mashhad, Iran"],"raw_orcid":"https://orcid.org/0000-0001-8477-0747","affiliations":[{"raw_affiliation_string":"Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111901328","display_name":"Sohrab Efati","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Sohrab Efati","raw_affiliation_strings":["Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, Mashhad, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86958956"],"apc_list":null,"apc_paid":null,"fwci":0.9164,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82400281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2012","issue":null,"first_page":"1","last_page":"7"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973000288009644,"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.9959999918937683,"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/benchmark","display_name":"Benchmark (surveying)","score":0.7275346517562866},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7168901562690735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6590023636817932},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5921722054481506},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5730074644088745},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.524483859539032},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.522871732711792},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49896836280822754},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4944493770599365},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4388236999511719},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4306715428829193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3217625617980957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26608455181121826},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1942850947380066}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7275346517562866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7168901562690735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590023636817932},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5921722054481506},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5730074644088745},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.524483859539032},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.522871732711792},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49896836280822754},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4944493770599365},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4388236999511719},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4306715428829193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3217625617980957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26608455181121826},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1942850947380066},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1155/2012/540861","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2012/540861","pdf_url":"https://downloads.hindawi.com/archive/2012/540861.pdf","source":{"id":"https://openalex.org/S2788495","display_name":"Advances in Artificial Intelligence","issn_l":"1687-7470","issn":["1687-7470","1687-7489"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1155/2012/540861","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2012/540861","pdf_url":"https://downloads.hindawi.com/archive/2012/540861.pdf","source":{"id":"https://openalex.org/S2788495","display_name":"Advances in Artificial Intelligence","issn_l":"1687-7470","issn":["1687-7470","1687-7489"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2111477207.pdf","grobid_xml":"https://content.openalex.org/works/W2111477207.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W10317251","https://openalex.org/W123765585","https://openalex.org/W143010625","https://openalex.org/W994432497","https://openalex.org/W1502579426","https://openalex.org/W1510805918","https://openalex.org/W1512453687","https://openalex.org/W1539702957","https://openalex.org/W1544329015","https://openalex.org/W1568811820","https://openalex.org/W1587451448","https://openalex.org/W1591000919","https://openalex.org/W1869466137","https://openalex.org/W2007351764","https://openalex.org/W2028667732","https://openalex.org/W2038659300","https://openalex.org/W2088134026","https://openalex.org/W2093505886","https://openalex.org/W2104324382","https://openalex.org/W2126269902","https://openalex.org/W2145479420","https://openalex.org/W2151339633","https://openalex.org/W2151777658","https://openalex.org/W2163023076","https://openalex.org/W2164655924","https://openalex.org/W2175677697"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W1980381208","https://openalex.org/W2130974462","https://openalex.org/W2726551571","https://openalex.org/W4286891655","https://openalex.org/W3209823386","https://openalex.org/W4292532243","https://openalex.org/W2022485595"],"abstract_inverted_index":{"Evolutionary":[0],"methods":[1,87,150],"are":[2,133,182],"well-known":[3],"techniques":[4],"for":[5,61],"solving":[6],"nonlinear":[7],"constrained":[8,176],"optimization":[9,47,177],"problems.":[10],"Due":[11],"to":[12,22,38,78,108,151,171],"the":[13,45,80,84,113,126,147,162,165,180,189],"exploration":[14,101],"power":[15,82,163],"of":[16,44,83,97,164,174],"evolution-based":[17],"optimizers,":[18],"population":[19],"usually":[20],"converges":[21],"a":[23,68,95,109,157,172,185],"region":[24],"around":[25,112],"global":[26,140],"optimum":[27],"after":[28],"several":[29],"generations.":[30],"Although":[31],"this":[32,122],"convergence":[33],"can":[34,145],"be":[35],"efficiently":[36],"used":[37],"reduce":[39],"search":[40,49,75,104,118],"space,":[41],"in":[42,156,188],"most":[43],"existing":[46,85,148],"methods,":[48],"is":[50,59,102,106,119,169],"still":[51],"continued":[52,120],"over":[53,121],"original":[54],"space":[55,76,105,127,137],"and":[56,70,116,131,179],"considerable":[57],"time":[58],"wasted":[60],"searching":[62],"ineffective":[63],"regions.":[64],"This":[65],"paper":[66],"proposes":[67],"simple":[69],"general":[71],"approach":[72],"based":[73],"on":[74],"reduction":[77,128],"improve":[79],"exploitation":[81],"evolutionary":[86,149],"without":[88],"adding":[89],"any":[90],"significant":[91],"computational":[92],"complexity.":[93],"After":[94],"number":[96],"generations":[98],"when":[99],"enough":[100],"performed,":[103],"reduced":[107,123,136],"small":[110],"subspace":[111],"best":[114],"individual,":[115],"then":[117],"space.":[124],"If":[125],"parameters":[129],"(red_gen":[130],"red_factor)":[132],"adjusted":[134],"properly,":[135],"will":[138],"include":[139],"optimum.":[141],"The":[142],"proposed":[143],"scheme":[144],"help":[146],"find":[152],"better":[153],"near-optimal":[154],"solutions":[155],"shorter":[158],"time.":[159],"To":[160],"demonstrate":[161],"new":[166],"approach,":[167],"it":[168],"applied":[170],"set":[173],"benchmark":[175],"problems":[178],"results":[181],"compared":[183],"with":[184],"previous":[186],"work":[187],"literature.":[190]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}