{"id":"https://openalex.org/W6945935741","doi":"https://doi.org/10.26190/unsworks/15629","title":"Evolutionary Approach for Constrained Optimization","display_name":"Evolutionary Approach for Constrained Optimization","publication_year":2022,"publication_date":"2022-03-21","ids":{"openalex":"https://openalex.org/W6945935741","doi":"https://doi.org/10.26190/unsworks/15629"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/52074","is_oa":false,"landing_page_url":"http://handle.unsw.edu.au/1959.4/52074","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1959.4/52074","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Elsayed, Saber","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elsayed, Saber","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6607000231742859,"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.6607000231742859,"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.1136000007390976,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.03579999879002571,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5771999955177307},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5485000014305115},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5037000179290771},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5034000277519226},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4724999964237213},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.47040000557899475},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44200000166893005},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.4092000126838684}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6703000068664551},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5485000014305115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5241000056266785},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5037000179290771},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.47040000557899475},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44200000166893005},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.4092000126838684},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3465000092983246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34220001101493835},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3273000121116638},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.3122999966144562},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C207002847","wikidata":"https://www.wikidata.org/wiki/Q2912857","display_name":"Evolution strategy","level":3,"score":0.29100000858306885},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.25929999351501465}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/52074","is_oa":false,"landing_page_url":"http://handle.unsw.edu.au/1959.4/52074","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/52074","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/52074","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},{"id":"doi:10.26190/unsworks/15629","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/15629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Dissertation"}],"best_oa_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/52074","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/52074","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Constrained":[0,61],"optimization":[1,52],"is":[2,21,148,245,268,295,328,369,381,401,413,452,464,481,519,531,593,602,619,645,685],"a":[3,71,110,128,144,151,223,264,286,291,313,348,351,355,365,389,394,409,446,460,495,548,558,574,582,590,598,628,650],"challenging":[4],"area":[5],"of":[6,74,101,138,154,193,202,222,242,250,259,275,284,320,347,362,417,428,442,450,456,490,501,584],"research":[7],"in":[8,115,174,397,512,677],"the":[9,15,39,136,200,210,247,257,318,345,360,399,430,435,457,477,499,502,515,522,526,536,552,571,578,606,636,654,664,672,680,686],"science":[10],"and":[11,27,80,105,109,150,160,181,186,189,195,214,226,232,237,270,273,279,290,306,309,354,422,445,510,565,586,601,614,631,657,668,675],"engineering":[12],"disciplines.":[13],"Locating":[14],"optimal":[16],"solutions":[17,487,509,624],"for":[18,50,59,78,91,112,131,246,288,293,375],"such":[19,178],"problems":[20,436,444],"often":[22],"difficult":[23],"as":[24,179,209,474],"their":[25,88,106,113],"characteristics":[26],"mathematical":[28],"properties":[29],"do":[30,262],"not":[31,95,121,532],"follow":[32],"any":[33],"standard":[34,549],"patterns":[35],"or":[36],"forms.":[37],"Over":[38],"last":[40],"few":[41],"decades,":[42],"evolutionary":[43],"algorithms":[44,82,104,142,155,299,642,656,673],"(EAs)":[45],"have":[46,83,94,120],"been":[47,85,96,122],"widely":[48],"used":[49,419],"solving":[51,60,92,132],"problems.":[53,75],"Although":[54],"there":[55],"are":[56,156,168,218,229,277,300,420],"many":[57,175],"EAs":[58,167,387,418],"Optimization":[62],"Problems":[63],"(COPs),":[64],"no":[65],"single":[66,145,349,352,356,390,496,537,629],"algorithm":[67,212,327,572],"performs":[68,562,643],"consistently":[69],"over":[70],"wide":[72],"range":[73],"Therefore,":[76,393],"ideas":[77],"multi-operator-":[79],"multi-methodology-based":[81],"recently":[84],"introduced":[86],"but":[87,540],"actual":[89],"strengths":[90],"COPs":[93,133],"fully":[97],"explored.":[98],"The":[99,240,325,372,415,466],"choice":[100,274],"operators":[102,140,251,276,308,380,588,616,653],"and/or":[103,141],"appropriate":[107,248],"mix,":[108],"strategy":[111],"use":[114,137,312,346,500],"designing":[116],"an":[117,376],"effective":[118],"EA":[119,377,638],"well":[123],"studied.":[124,169],"In":[125,162,337],"this":[126,163,203,469,678],"thesis,":[127,679],"general":[129],"framework":[130,373],"that":[134],"allows":[135],"different":[139,176,191,206,333,439,632,641],"under":[143,388],"algorithmic":[146,391],"structure":[147],"proposed":[149,374,431],"good":[152],"number":[153,272,319,416],"designed,":[157],"implemented,":[158],"analyzed":[159],"tested.":[161],"research,":[164],"firstly,":[165],"multi-operator":[166,224,411,478,516,554,666,683],"They":[170],"can":[171,471],"be":[172,253,472],"implemented":[173,230,674],"ways,":[177],"with":[180,231,256,378,494,521,557,581,611,627,639,649],"without":[182,233,573,597],"population":[183,235,400],"divisions,":[184],"adaptations":[185],"local":[187,238,366,559,575,591,599],"searches,":[188],"offer":[190],"ways":[192],"choosing":[194],"mixing":[196],"operators.":[197],"To":[198,261,358,424],"test":[199],"robustness":[201],"concept,":[204],"two":[205,438],"EAs,":[207],"known":[208],"genetic":[211],"(GA)":[213],"differential":[215],"evolution":[216],"(DE),":[217],"considered.":[219,296],"Different":[220],"variants":[221],"GA":[225,289,480,493,518],"multioperator":[227,528],"DE":[228,530,539,556,580,610,626,648,684],"self-adaptation,":[234],"changes":[236],"searches.":[239],"purpose":[241],"introducing":[243],"self-adaptation":[244],"mix":[249,583],"to":[252,302,311,316,323,331,384,483,506,605,621,647],"automatically":[254],"chosen":[255],"progress":[258],"evolution.":[260],"this,":[263],"new":[265,395,461],"self-adaptive":[266,314,503,527,553,579,665,682],"mechanism":[267,315,504],"derived":[269],"its":[271,338],"discussed":[278,421],"justified.":[280],"Initially,":[281],"one":[282],"type":[283],"operator,":[285],"crossover":[287,305,585,613],"mutation":[292,307,353,587,615,652],"DE,":[294],"Later,":[297],"these":[298,363],"extended":[301,330,383],"include":[303,332,385],"multiple":[304,379,386,612,651],"designed":[310],"change":[317],"individuals":[321],"assigned":[322],"each.":[324],"DE-based":[326],"further":[329,382],"constraint-handling":[334],"techniques":[335],"(CHTs).":[336],"implementation,":[339],"each":[340,406,491],"chromosome":[341],"contains":[342],"information":[343],"on":[344],"crossover,":[350],"CHT.":[357],"accelerate":[359],"performances":[361,427],"algorithms,":[364,432,459],"search":[367,560,592,600],"technique":[368,561],"also":[370,541,603],"applied.":[371],"framework.":[392],"algorithm,":[396],"which":[398],"divided":[402],"into":[403],"sub-populations,":[404],"where":[405],"subpopulation":[407],"runs":[408],"defined":[410],"EA,":[412],"introduced.":[414,465],"analyzed.":[423],"demonstrate":[425],"consistent":[426],"all":[429,671],"they":[433],"solve":[434],"from":[437,468],"specialized":[440],"sets":[441],"benchmark":[443],"detailed":[447],"parametric":[448],"analysis":[449],"them":[451],"provided.":[453],"For":[454],"comparisons":[455],"competing":[458],"comparison":[462],"matrix":[463],"results":[467],"thesis":[470],"summarized":[473],"follows:":[475],"(1)":[476],"based":[479,517,529,555],"able":[482,620],"obtain":[484,622],"much":[485,507,563],"better":[486,508,534,564,594,623],"than":[488,535,547,570,595,625,663],"those":[489,596],"independent":[492],"operator;":[497],"(2)":[498],"leads":[505],"savings":[511],"time;":[513],"(3)":[514],"competitive":[520],"state-of-the-art":[523,607,633,655],"algorithms;":[524,608,634],"(4)":[525],"only":[533],"operator-based":[538],"takes":[542,566],"25%":[543],"less":[544,568,660],"computational":[545,569,661],"time":[546,662],"DE;":[550,667],"(5)":[551],"48%":[567],"search;":[576],"(6)":[577],"plus":[589,617],"superior":[604,646],"(7)":[609],"CHTs":[618],"operator":[630],"(8)":[635],"multi-methodology":[637],"three":[640],"best,":[644],"consumes":[658],"26%":[659],"(9)":[669],"considering":[670],"tested":[676],"memetic":[681],"best.":[687]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}