{"id":"https://openalex.org/W2158642632","doi":"https://doi.org/10.1109/cec.2009.4983265","title":"A novel hybrid constraint handling technique for evolutionary optimization","display_name":"A novel hybrid constraint handling technique for evolutionary optimization","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2158642632","doi":"https://doi.org/10.1109/cec.2009.4983265","mag":"2158642632"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on 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/A5013190044","display_name":"Ashish Mani","orcid":"https://orcid.org/0000-0002-2312-1185"},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ashish Mani","raw_affiliation_strings":["Dayalbagh Educational Institute (Deemed University), Agra, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072764860","display_name":"C. Patvardhan","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Patvardhan","raw_affiliation_strings":["Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2649,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.90081187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2577","last_page":"2583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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.9965999722480774,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9865999817848206,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.6991764307022095},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6739094257354736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6603854298591614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6543776988983154},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5972009897232056},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.591526210308075},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.510934054851532},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.49735239148139954},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4885350167751312},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24096572399139404},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18697282671928406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16224390268325806}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6991764307022095},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6739094257354736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6603854298591614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6543776988983154},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5972009897232056},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.591526210308075},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.510934054851532},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.49735239148139954},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4885350167751312},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24096572399139404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18697282671928406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16224390268325806},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W167027853","https://openalex.org/W329913983","https://openalex.org/W1512136126","https://openalex.org/W1562515403","https://openalex.org/W1587451448","https://openalex.org/W1614330250","https://openalex.org/W2012185375","https://openalex.org/W2038659300","https://openalex.org/W2042594698","https://openalex.org/W2142183404","https://openalex.org/W2145479420","https://openalex.org/W2148298821","https://openalex.org/W2149815769","https://openalex.org/W2151339633","https://openalex.org/W2163023076","https://openalex.org/W2167580870","https://openalex.org/W4206448558","https://openalex.org/W4301173492","https://openalex.org/W6606754508"],"related_works":["https://openalex.org/W2912146214","https://openalex.org/W2152334450","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2911717707","https://openalex.org/W2391924736","https://openalex.org/W3123416417","https://openalex.org/W2474851184","https://openalex.org/W4312509357","https://openalex.org/W23263483"],"abstract_inverted_index":{"Evolutionary":[0,31],"Algorithms":[1,32],"are":[2,18,23,41,71],"amongst":[3],"the":[4,65,72,143,146,150,169,172],"best":[5],"known":[6],"methods":[7,17,151],"of":[8,63,83,97,171],"solving":[9],"difficult":[10],"constraint":[11,53,114],"optimization":[12,37,50,107],"problems,":[13],"for":[14,33,78,117,139],"which":[15,102,124],"traditional":[16],"not":[19],"applicable.":[20],"However,":[21,81],"there":[22],"no":[24],"inbuilt":[25],"or":[26,45,99],"organic":[27],"mechanisms":[28],"available":[29],"in":[30,36,61,103,148],"handling":[34,54,115,140],"constraints":[35],"problems.":[38,51],"These":[39],"problems":[40,167],"solved":[42],"by":[43],"converting":[44],"treating":[46],"them":[47],"as":[48,134,136],"unconstrained":[49],"Several":[52],"techniques":[55,85],"have":[56],"been":[57],"developed":[58],"and":[59,68,75,90,92,129,152,158],"reported":[60],"literature,":[62],"which,":[64],"penalty":[66,131],"factor":[67,132],"feasibility":[69,137],"rules":[70,138],"most":[73],"promising":[74],"widely":[76],"used":[77],"such":[79],"purposes.":[80],"each":[82],"these":[84],"has":[86],"its":[87],"own":[88],"advantages":[89],"disadvantages":[91],"often":[93],"require":[94],"fine":[95],"tuning":[96],"one":[98],"more":[100],"parameters,":[101],"itself":[104],"becomes":[105],"an":[106],"problem.":[108],"This":[109],"paper":[110],"presents":[111],"a":[112,118,126],"hybrid":[113],"technique":[116],"two":[119],"population":[120],"adaptive":[121],"co-evolutionary":[122],"algorithm,":[123],"uses":[125],"self":[127],"determining":[128],"regulating":[130],"method":[133,144],"well":[135],"constraints.":[141,161],"Thus,":[142],"overcomes":[145],"drawbacks":[147],"both":[149],"utilizes":[153],"their":[154],"strengths":[155],"to":[156],"effectively":[157],"efficiently":[159],"handle":[160],"The":[162],"simulation":[163],"on":[164],"ten":[165],"benchmark":[166],"demonstrates":[168],"efficacy":[170],"approach.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}