{"id":"https://openalex.org/W4249326782","doi":"https://doi.org/10.1145/2598394.2605348","title":"Constraint-handling techniques used with evolutionary algorithms","display_name":"Constraint-handling techniques used with evolutionary algorithms","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W4249326782","doi":"https://doi.org/10.1145/2598394.2605348"},"language":"en","primary_location":{"id":"doi:10.1145/2598394.2605348","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2598394.2605348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","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/A5085548317","display_name":"Carlos A. Coello Coello","orcid":"https://orcid.org/0000-0002-8435-680X"},"institutions":[{"id":"https://openalex.org/I68368234","display_name":"Center for Research and Advanced Studies of the National Polytechnic Institute","ror":"https://ror.org/009eqmr18","country_code":"MX","type":"facility","lineage":["https://openalex.org/I59361560","https://openalex.org/I68368234"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Carlos Artemio Coello Coello","raw_affiliation_strings":["CINVESTAV-IPN, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"CINVESTAV-IPN, Mexico City, Mexico","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085548317"],"corresponding_institution_ids":["https://openalex.org/I68368234"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32708536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"535","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9943000078201294,"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.9943000078201294,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.92330002784729,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9103000164031982,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.7123255729675293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6950777769088745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6157498359680176},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5080409049987793},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.47309425473213196},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4451886713504791},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.44244900345802307},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4418870210647583},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4353387951850891},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4290471374988556},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4209640622138977},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4165002107620239},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.41163045167922974},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.324396550655365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26688483357429504},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.24493667483329773}],"concepts":[{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7123255729675293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6950777769088745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6157498359680176},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5080409049987793},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.47309425473213196},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4451886713504791},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.44244900345802307},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4418870210647583},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4353387951850891},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4290471374988556},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4209640622138977},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4165002107620239},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.41163045167922974},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.324396550655365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26688483357429504},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.24493667483329773},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2598394.2605348","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2598394.2605348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.49000000953674316},{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2377522634","https://openalex.org/W2367437354","https://openalex.org/W2362627879","https://openalex.org/W2374291142","https://openalex.org/W2393932733","https://openalex.org/W2016611441","https://openalex.org/W2134781290","https://openalex.org/W2145479420","https://openalex.org/W1533819690","https://openalex.org/W2183911804"],"abstract_inverted_index":{"Evolutionary":[0],"Algorithms":[1],"(EAs),":[2],"when":[3],"used":[4],"for":[5],"global":[6],"optimization,":[7,197],"can":[8],"be":[9,67,73,204],"seen":[10],"as":[11,148,179],"unconstrained":[12],"optimization":[13,158],"techniques.":[14],"Therefore,":[15],"they":[16],"require":[17],"an":[18,50,70,132],"additional":[19],"mechanism":[20],"to":[21,66,75,96,124],"incorporate":[22,125],"constraints":[23,126],"of":[24,39,55,62,119,122,131,151,182,190],"any":[25],"kind":[26],"(i.e.,":[27],"inequality,":[28],"equality,":[29],"linear,":[30],"nonlinear)":[31],"into":[32,127],"their":[33],"fitness":[34,129],"function.":[35],"Although":[36],"the":[37,63,77,81,90,102,105,109,117,128,138,149,180,188],"use":[38,150,189],"penalty":[40,64,82,110],"functions":[41],"(very":[42],"popular":[43],"with":[44,104,161],"mathematical":[45,162],"programming":[46,163],"techniques)":[47],"may":[48,72,87],"seem":[49],"obvious":[51],"choice,":[52],"this":[53],"sort":[54],"approach":[56],"requires":[57],"a":[58,120],"careful":[59],"fine":[60],"tuning":[61],"factors":[65],"used.":[68],"Otherwise,":[69],"EA":[71],"unable":[74,95],"reach":[76,88],"feasible":[78,91],"region":[79,92,107],"(if":[80,108],"is":[83,111],"too":[84,112],"low)":[85],"or":[86],"quickly":[89],"but":[93],"being":[94],"locate":[97],"solutions":[98],"that":[99],"lie":[100],"in":[101,141],"boundary":[103],"infeasible":[106],"severe).":[113],"This":[114,134],"has":[115],"motivated":[116],"development":[118],"number":[121],"approaches":[123,146],"function":[130],"EA.":[133],"tutorial":[135],"will":[136,203],"cover":[137],"main":[139],"proposals":[140],"current":[142,185],"use,":[143],"including":[144],"novel":[145],"such":[147,178],"tournament":[152],"rules":[153],"based":[154],"on":[155],"feasibility,":[156],"multiobjective":[157],"concepts,":[159],"hybrids":[160],"techniques":[164],"(e.g.,":[165,194],"Lagrange":[166],"multipliers),":[167],"cultural":[168],"algorithms,":[169],"and":[170,187],"artificial":[171],"immune":[172],"systems,":[173],"among":[174],"others.":[175],"Other":[176],"topics":[177],"importance":[181],"maintaining":[183],"diversity,":[184],"benchmarks":[186],"alternative":[191],"search":[192],"engines":[193],"particle":[195],"swarm":[196],"differential":[198],"evolution,":[199],"evolution":[200],"strategies,":[201],"etc.)":[202],"also":[205],"discussed":[206],"(as":[207],"time":[208],"allows).":[209]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}