{"id":"https://openalex.org/W6889872030","doi":"https://doi.org/10.26190/unsworks/16774","title":"Development of algorithms to solve different key challenges facing design optimization","display_name":"Development of algorithms to solve different key challenges facing design optimization","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W6889872030","doi":"https://doi.org/10.26190/unsworks/16774"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/53458","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/53458","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/16774","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Asafuddoula, Md","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Asafuddoula, Md","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":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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3301999866962433,"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.3301999866962433,"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.21379999816417694,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1177000030875206,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/metaheuristic","display_name":"Metaheuristic","score":0.7530999779701233},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5370000004768372},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5123000144958496},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5048999786376953},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45840001106262207},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39250001311302185},{"id":"https://openalex.org/keywords/engineering-optimization","display_name":"Engineering optimization","score":0.384799987077713},{"id":"https://openalex.org/keywords/development","display_name":"Development (topology)","score":0.3797999918460846}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7530999779701233},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6394000053405762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5659999847412109},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5048999786376953},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.384799987077713},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C2780343955","wikidata":"https://www.wikidata.org/wiki/Q333173","display_name":"Surprise","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.27790001034736633},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.271699994802475},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/53458","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/53458","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/16774","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/16774","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":"Dissertation"}],"best_oa_location":{"id":"doi:10.26190/unsworks/16774","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/16774","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":"Dissertation"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.43086203932762146}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimization":[0],"methods":[1,19,65,130,407],"play":[2],"an":[3,175,183,211,302,320],"indispensable":[4],"role":[5],"in":[6,83,279,294,374,378,393],"today\u2019s":[7],"competitive":[8,450],"environment":[9],"and":[10,31,93,110,128,171,213,244,274,349,354,406,428,470],"there":[11],"are":[12,136,231,288,391,492],"plenty":[13],"of":[14,37,46,77,86,108,148,150,169,195,210,218,238,264,301,331,359,381,388,396,403,416,431,458,461,479,489],"practical":[15,200],"examples":[16],"where":[17,385],"such":[18,61,78,101,142],"have":[20,40,122,411],"been":[21,412],"used":[22],"to":[23,43,89,124,139,187,207,298,304,335,408],"identify":[24,90],"better":[25],"performing":[26],"designs":[27],"(Boeing":[28],"787":[29],"Dreamliner":[30],"NASA":[32],"ST5":[33],"antenna).":[34],"Increasing":[35],"complexity":[36],"the":[38,44,84,117,167,193,208,236,245,256,277,280,299,329,332,350,357,379,386,394,445,459,462,477,481],"problems":[39,102,307,491],"also":[41],"led":[42],"development":[45,168,209,300],"sophisti-":[47],"cated":[48],"mathematical":[49],"models":[50],"that":[51,166,444],"can":[52],"only":[53],"be":[54,125,474],"solved":[55],"using":[56,241,422,439],"computationally":[57],"expensive":[58],"numerical":[59,79,132],"simulations":[60,80],"as":[62,134],"finite":[63],"element":[64],"(FEM),":[66],"computational":[67,71],"fluids":[68],"dynamics":[69],"(CFD),":[70],"electromagnetics":[72],"(CEM),":[73],"etc.":[74],"Repeated":[75],"use":[76],"is":[81,155,163,174,185,253,276,325,361,377,419,464],"necessary":[82],"context":[85],"optimization,":[87],"i.e.,":[88,233,313],"optimum":[91],"products":[92],"processes":[94],"with":[95,141,220,235,337,476],"outstanding":[96],"performance":[97,114,415],"features.":[98],"In":[99,180,224,317,466],"reality,":[100],"often":[103,111],"involve":[104],"a":[105,265,345,364,429,456],"large":[106],"number":[107],"constraints":[109,263],"demand":[112],"multiple":[113,285],"considerations.":[115],"Over":[116],"decades,":[118],"population":[119,152,196],"based":[120,153,197,322],"metaheuristics":[121,154,173,198],"proven":[123],"efficient,":[126],"robust":[127,382,404],"versatile":[129],"for":[131,199,485],"optimization":[133,215,222,306,340,384,434,490],"they":[135],"more":[137,309,483],"amenable":[138],"deal":[140,336],"black-box":[143],"problems.":[144,223,341,435],"The":[145,203,251,290,342,370,414,436],"major":[146],"downside":[147],"any":[149],"these":[151,417],"their":[156],"extremely":[157],"long":[158],"run":[159],"time.":[160],"Therefore,":[161],"it":[162,269],"no":[164],"surprise":[165],"fast":[170],"efficient":[172,212,484],"actively":[176],"pursued":[177,475],"research":[178],"area.":[179],"this":[181,295,318,375],"thesis,":[182],"effort":[184],"made":[186,373],"address":[188],"three":[189],"key":[190],"challenges":[191],"facing":[192],"adoption":[194],"design":[201,383,405,433],"optimization.":[202],"first":[204],"challenge":[205],"relates":[206,297],"reliable":[214],"algorithm":[216,303,321,343],"capable":[217],"dealing":[219],"constrained":[221],"particular,":[225],"two":[226],"novel":[227],"constraint":[228,242,249,286],"handling":[229,486],"mechanisms":[230],"introduced":[232,326],"one":[234,260,272],"concept":[237],"partial":[239],"evaluation":[240],"sequencing":[243],"other":[246],"involving":[247,308],"adaptive":[248],"handling.":[250],"study":[252],"motivated":[254],"by":[255],"fundamental":[257],"question":[258],"should":[259],"evaluate":[261],"all":[262],"solution":[266],"even":[267],"if":[268,284],"has":[270],"violated":[271],"constraint?":[273],"what":[275],"difference":[278],"underlying":[281],"search":[282,360],"process":[283],"sequences":[287],"used?.":[289],"second":[291],"contribution":[292,372],"reported":[293],"thesis":[296,376],"tackle":[305],"than":[310],"four":[311],"objectives,":[312],"many":[314,338],"objective":[315,339],"optimizations.":[316],"context,":[319],"on":[323],"decomposition":[324],"which":[327,472],"extends":[328],"capability":[330],"well-known":[333],"MOEA/D":[334],"incorporates":[344],"systematic":[346],"sampling":[347],"scheme":[348],"balance":[351],"between":[352],"convergence":[353],"diversity":[355],"during":[356],"course":[358],"maintained":[362],"via":[363],"simple":[365],"preemptive":[366],"distance":[367],"comparison":[368],"scheme.":[369],"third":[371],"area":[380],"effects":[387],"various":[389,440,487],"formulations":[390,402],"studied":[392],"framework":[395],"six-sigma":[397],"quality.":[398],"Four":[399],"different":[400],"problem":[401],"solve":[409],"them":[410],"proposed.":[413],"algorithms/schemes":[418],"rigorously":[420],"assessed":[421,438],"well":[423],"es-":[424],"tablished":[425],"benchmark":[426],"functions":[427],"suite":[430],"engineering":[432],"results":[437],"measures":[441],"clearly":[442],"indicate":[443],"proposed":[446],"develop-":[447],"ments":[448],"offer":[449],"advantages":[451],"over":[452],"existing":[453],"schemes.":[454],"Finally,":[455],"summary":[457],"findings":[460],"work":[463],"presented.":[465],"addition,":[467],"future":[468],"issues":[469],"directions":[471],"could":[473],"aim":[478],"making":[480],"algorithms":[482],"types":[488],"identified.":[493]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}