{"id":"https://openalex.org/W6927165934","doi":"https://doi.org/10.26190/unsworks/15600","title":"Evolutionary Algorithms for Constrained Optimization","display_name":"Evolutionary Algorithms for Constrained Optimization","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W6927165934","doi":"https://doi.org/10.26190/unsworks/15600"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/52044","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/52044","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.26190/unsworks/15600","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Elfeky, Ehab Zaky Mohammed Abdullah","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elfeky, Ehab Zaky Mohammed Abdullah","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.3077000081539154,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.3077000081539154,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12824","display_name":"Infections and bacterial resistance","score":0.08340000361204147,"subfield":{"id":"https://openalex.org/subfields/1310","display_name":"Endocrinology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11470","display_name":"Legume Nitrogen Fixing Symbiosis","score":0.056299999356269836,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5598000288009644},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5573999881744385},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5382000207901001},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5123000144958496},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.4968999922275543},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.43459999561309814},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4316999912261963},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.4034999907016754},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.392300009727478}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6899999976158142},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5598000288009644},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5573999881744385},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5382000207901001},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45179998874664307},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.4034999907016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3977999985218048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3968999981880188},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.392300009727478},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.3840000033378601},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.3668000102043152},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.2596000134944916},{"id":"https://openalex.org/C207002847","wikidata":"https://www.wikidata.org/wiki/Q2912857","display_name":"Evolution strategy","level":3,"score":0.25690001249313354},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/52044","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/52044","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":null,"license_id":null,"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/15600","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/15600","pdf_url":null,"source":{"id":"https://openalex.org/S7407053176","display_name":"University of New South Wales","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"doi:10.26190/unsworks/15600","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/15600","pdf_url":null,"source":{"id":"https://openalex.org/S7407053176","display_name":"University of New South Wales","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Most":[0],"real":[1],"world":[2],"optimization":[3,41,59,206,226,304],"problems,":[4],"and":[5,25,31,113,130,150,159,166,222,282,305,328],"their":[6],"corresponding":[7],"models,":[8],"are":[9,246],"complex.":[10],"This":[11,234],"complexity":[12,202],"arises":[13],"from":[14],"different":[15],"sources,":[16],"such":[17,278],"as":[18,39,48,67,259,270,272],"existence":[19],"of":[20,57,142,155,186,188,203,213,219],"the":[21,44,51,55,65,87,92,153,156,160,183,189,201,204,214,220,223,244,257,268,273,287,298,303,307,313,333,337],"constraints,":[22],"function":[23],"characteristics,":[24],"high":[26],"dimensionality.":[27],"Evolutionary":[28],"Algorithms":[29,34],"(EAs)":[30],"specially":[32],"Genetic":[33],"(GAs)":[35],"have":[36,50,147,291],"proven":[37],"themselves":[38],"efficient":[40],"techniques":[42],"over":[43],"last":[45],"two":[46,135],"decades;":[47],"they":[49],"ability":[52],"to":[53,181,295],"overcome":[54],"drawbacks":[56],"conventional":[58],"methods.":[60],"Therefore,":[61],"this":[62,97,99,193,330],"thesis":[63,100,194],"addresses":[64],"GAs":[66],"a":[68,102,122,131,164,175,217,230,238,260,319,323],"solution":[69,89],"methodology":[70],"for":[71,79,106,170],"solving":[72,107,277],"Constrained":[73],"Optimization":[74],"Problems":[75],"(COPs).":[76],"In":[77,173],"COPs":[78],"practical":[80,325],"applications,":[81],"it":[82],"is":[83,116,179,227,254],"more":[84],"likely":[85],"that":[86,198],"optimal":[88],"lies":[90],"on":[91,127,252,322],"feasible":[93],"region":[94],"boundary.":[95],"Utilizing":[96],"feature,":[98],"introduces":[101,195],"new":[103,111,123],"genetic":[104],"algorithm":[105,162,197,215,235,266,314,335],"small-scale":[108],"COPs.":[109],"A":[110,140],"ranking":[112],"selection":[114],"scheme":[115],"introduced":[117],"in":[118,242,256,318,343],"conjunction":[119],"with":[120,152,237,281],"both":[121,280],"crossover":[124],"method":[125],"based":[126,251,341],"three":[128],"parents,":[129],"mixed":[132],"mutation":[133,138],"between":[134,286],"currently":[136],"existing":[137],"methodologies.":[139],"number":[141],"well":[143,271],"known":[144],"benchmark":[145],"problems":[146,245,279],"been":[148,292,316],"solved":[149],"compared":[151],"state":[154],"art":[157],"algorithms,":[158],"proposed":[161,190,265,334],"shows":[163,331],"competitive":[165],"even":[167],"superior":[168],"performance":[169],"some":[171],"problems.":[172],"addition,":[174],"detailed":[176],"parametric":[177],"analysis":[178],"provided":[180],"show":[182,296],"individual":[184],"effect":[185],"each":[187],"components.":[191],"Furthermore,":[192],"another":[196],"breaks":[199],"down":[200],"constrained":[205],"process":[207,301],"into":[208],"smaller":[209],"dimensions.":[210,345],"Every":[211],"sub-component":[212],"maintains":[216],"part":[218],"problem,":[221],"whole":[224],"problem":[225,240,327],"treated":[228],"through":[229],"designed":[231,299],"communication":[232,300],"process.":[233],"deals":[236],"special":[239],"structure,":[241],"which":[243],"entirely":[247],"or":[248],"almost":[249],"decomposable":[250],"what":[253,306],"called":[255],"literature":[258],"block":[261],"angular":[262],"structure.":[263],"The":[264],"decomposes":[267],"constraints":[269],"chromosomes.":[274],"It":[275],"facilitates":[276],"without":[283],"overlapping":[284],"variables":[285],"sub-components.":[288],"Some":[289],"experiments":[290],"carried":[293],"out":[294],"how":[297,332],"controls":[302],"best":[308],"parameter":[309],"settings":[310],"are.":[311],"Then,":[312],"has":[315],"implemented":[317],"parallel":[320],"environment":[321],"scalable":[324],"test":[326],"using":[329],"outperforms":[336],"other":[338],"single":[339],"population":[340],"algorithms":[342],"higher":[344]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}