{"id":"https://openalex.org/W2058362805","doi":"https://doi.org/10.1109/sde.2013.6601439","title":"Evaluate till you violate: A differential evolution algorithm based on partial evaluation of the constraint set","display_name":"Evaluate till you violate: A differential evolution algorithm based on partial evaluation of the constraint set","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2058362805","doi":"https://doi.org/10.1109/sde.2013.6601439","mag":"2058362805"},"language":"en","primary_location":{"id":"doi:10.1109/sde.2013.6601439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sde.2013.6601439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Differential Evolution (SDE)","raw_type":"proceedings-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/A5014752949","display_name":"Md Asafuddoula","orcid":"https://orcid.org/0000-0003-4102-6349"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I4394709116","display_name":"UNSW Canberra","ror":"https://ror.org/0125wpx05","country_code":null,"type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Md Asafuddoula","raw_affiliation_strings":["[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061883146","display_name":"Tapabrata Ray","orcid":"https://orcid.org/0000-0003-1950-5917"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I4394709116","display_name":"UNSW Canberra","ror":"https://ror.org/0125wpx05","country_code":null,"type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tapabrata Ray","raw_affiliation_strings":["[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027440671","display_name":"Ruhul Sarker","orcid":"https://orcid.org/0000-0002-1363-2774"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I4394709116","display_name":"UNSW Canberra","ror":"https://ror.org/0125wpx05","country_code":null,"type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ruhul Sarker","raw_affiliation_strings":["[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Engineering and Information Technology, University of New South, Wales Canberra, ACT, Australia]","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I4394709116"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8623,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8579029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"32","issue":null,"first_page":"31","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994000196456909,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9937000274658203,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7340764999389648},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6033921837806702},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5760932564735413},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5551530718803406},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.516685962677002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49566924571990967},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.46230071783065796},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4428974390029907},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.4329308867454529},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4257675111293793},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.42560967803001404},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4200858473777771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3426430821418762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33538103103637695},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.15718698501586914}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7340764999389648},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6033921837806702},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5760932564735413},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5551530718803406},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.516685962677002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49566924571990967},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.46230071783065796},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4428974390029907},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.4329308867454529},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4257675111293793},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.42560967803001404},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4200858473777771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3426430821418762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33538103103637695},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.15718698501586914},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sde.2013.6601439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sde.2013.6601439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Differential Evolution (SDE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W152282416","https://openalex.org/W594715840","https://openalex.org/W2013579060","https://openalex.org/W2030404411","https://openalex.org/W2038984515","https://openalex.org/W2099618241","https://openalex.org/W2121780193","https://openalex.org/W2139747021","https://openalex.org/W2143381319","https://openalex.org/W2145479420","https://openalex.org/W4285719527","https://openalex.org/W6675139492"],"related_works":["https://openalex.org/W2394392475","https://openalex.org/W2069937987","https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W1571424162","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2073147994","https://openalex.org/W2022485595"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,23,47,64],"are":[2,13,18,219,242],"a":[3,39,170,179,186,189,204,216,229,286,294],"popular":[4],"choice":[5],"for":[6],"solving":[7],"multi-disciplinary":[8],"optimization":[9,37,234],"problems":[10],"as":[11,99],"they":[12],"simple":[14],"to":[15,29,56,194,207,273],"use":[16,48],"and":[17,124,165,246,283],"widely":[19],"applicable.":[20],"However,":[21],"such":[22,46,66,93,132,215],"require":[24],"numerous":[25],"function":[26],"evaluations":[27],"prior":[28],"its":[30,226,262],"convergence.":[31],"In":[32,174],"the":[33,61,75,78,84,102,109,127,138,145,153,192,196,209,239,247,269,275],"context":[34],"of":[35,42,51,74,87,104,131,155,178,214,231,238,260,298],"constrained":[36],"(i.e.":[38,90],"vast":[40],"majority":[41],"real":[43],"life":[44],"problems),":[45],"some":[49],"sort":[50],"constraint":[52,67,172,254],"violation":[53,68,255],"(CV)":[54],"measure":[55,69,256],"rank":[57],"infeasible":[58],"solutions":[59,89],"in":[60,83,126,290,293],"population.":[62],"Existing":[63],"compute":[65],"by":[70],"evaluating":[71,105],"all":[72,261],"constraints":[73,107,133],"problem.":[76],"If":[77],"user":[79],"is":[80,101,134,150,160,168,181,271],"only":[81],"interested":[82],"final":[85],"set":[86,297],"feasible":[88,197,277],"Pareto":[91,210],"solutions),":[92],"an":[94,148,222],"approach":[95,195,218,241,270],"can":[96],"be":[97],"questioned":[98],"\u201cwhat":[100],"worth":[103],"subsequent":[106],"when":[108],"solution":[110,180,278],"has":[111,285],"already":[112],"violated":[113],"at":[114],"least":[115],"once":[116],"?\u201d.":[117],"This":[118],"question":[119],"becomes":[120],"even":[121],"more":[122],"relevant":[123],"important":[125],"event":[128],"if":[129],"evaluation":[130,177,259],"computationally":[135],"expensive":[136],"or":[137],"problem":[139],"involves":[140],"many":[141],"constraints.":[142,263],"Based":[143],"on":[144,253],"above":[146],"motivation,":[147],"algorithm":[149,251],"designed":[151],"using":[152,221],"framework":[154],"differential":[156,249],"evolution.":[157],"The":[158,212,236,264],"population":[159,193],"divided":[161],"into":[162],"multiple":[163],"sub-populations":[164],"each":[166],"sub-population":[167],"assigned":[169],"prescribed":[171],"sequence.":[173],"any":[175],"sub-population,":[176],"aborted":[182],"whenever":[183],"it":[184],"violates":[185],"constraint.":[187],"Such":[188],"strategy":[190],"allows":[191],"space":[198],"from":[199],"different":[200],"directions,":[201],"thereby":[202],"offering":[203],"greater":[205,287],"chance":[206],"reach":[208],"front.":[211],"benefits":[213],"sequencing":[217],"illustrated":[220],"example":[223],"before":[224],"illustrating":[225],"performance":[227],"across":[228],"number":[230],"engineering":[232],"design":[233],"problems.":[235],"results":[237,265,292],"proposed":[240],"compared":[243],"with":[244],"NSGA-II":[245],"same":[248],"evolution":[250],"relying":[252],"derived":[257],"through":[258],"clearly":[266],"indicate,":[267],"that":[268],"able":[272],"identify":[274],"first":[276],"earlier":[279],"than":[280],"other":[281],"approaches":[282],"often":[284],"diversity":[288],"which":[289],"turn":[291],"better":[295],"non-dominated":[296],"solutions.":[299]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}