{"id":"https://openalex.org/W2071556601","doi":"https://doi.org/10.1109/nabic.2009.5393677","title":"Is stochastic ranking really better than Feasibility Rules for constraint handling in Evolutionary Algorithms?","display_name":"Is stochastic ranking really better than Feasibility Rules for constraint handling in Evolutionary Algorithms?","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2071556601","doi":"https://doi.org/10.1109/nabic.2009.5393677","mag":"2071556601"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2009.5393677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","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/A5034129361","display_name":"Sulabh Bansal","orcid":"https://orcid.org/0000-0003-4993-8879"},"institutions":[{"id":"https://openalex.org/I34750443","display_name":"Anand Agricultural University","ror":"https://ror.org/050qxn185","country_code":"IN","type":"education","lineage":["https://openalex.org/I34750443"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sulabh Bansal","raw_affiliation_strings":["Department of Computer Science and Engineering, Anand Engineering College, Agra, India","Dept. of Computer Science and Engineering, Anand Engineering College, Agra, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Anand Engineering College, Agra, India","institution_ids":["https://openalex.org/I34750443"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Anand Engineering College, Agra, India","institution_ids":["https://openalex.org/I34750443"]}]},{"author_position":"middle","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":["Department of Electrical Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#","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, Dayalbagh Educational Institute (Deemed University), Agra, India","Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#","institution_ids":["https://openalex.org/I178254495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034129361"],"corresponding_institution_ids":["https://openalex.org/I34750443"],"apc_list":null,"apc_paid":null,"fwci":1.7447,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87041412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1564","last_page":"1567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9980000257492065,"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.9941999912261963,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7430334687232971},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.721904993057251},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6641623973846436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6107742786407471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6016726493835449},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5649133920669556},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5419325828552246},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.491581529378891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37652844190597534},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2862536311149597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2715585231781006}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7430334687232971},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.721904993057251},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6641623973846436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6107742786407471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6016726493835449},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5649133920669556},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5419325828552246},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.491581529378891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37652844190597534},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2862536311149597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2715585231781006},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2009.5393677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","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":11,"referenced_works":["https://openalex.org/W1639032689","https://openalex.org/W1976345770","https://openalex.org/W1984893203","https://openalex.org/W2042594698","https://openalex.org/W2139747021","https://openalex.org/W2145479420","https://openalex.org/W2151339633","https://openalex.org/W2158642632","https://openalex.org/W2167580870","https://openalex.org/W2171166218","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W2021957875","https://openalex.org/W2802808995","https://openalex.org/W2787833928","https://openalex.org/W2593449396","https://openalex.org/W2780789525"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,14],"have":[2],"been":[3,76],"widely":[4,56],"used":[5],"to":[6,132],"solve":[7],"difficult":[8],"constrained":[9],"optimization":[10,18],"problems.":[11],"However,":[12,69],"evolutionary":[13,52,96,113],"are":[15,153],"intrinsically":[16],"unconstrained":[17],"techniques.":[19],"Constraint":[20],"handling":[21,49,67,89,108],"is":[22,55,61,91],"mostly":[23],"incorporated":[24],"additionally":[25],"and":[26,127,136],"its":[27],"choice":[28],"has":[29,74],"great":[30],"bearing":[31],"on":[32,93,110],"the":[33,36,63,79,83,87,94,102,106,111,148],"quality":[34],"of":[35,85,104,118,138],"solution.":[37],"Stochastic":[38],"ranking":[39,60],"was":[40],"introduced":[41],"as":[42],"an":[43],"improvement":[44],"over":[45,115,147],"feasibility":[46,121,151],"rules":[47,152],"for":[48,66],"constraints":[50],"in":[51,78,130],"optimization.":[53],"It":[54],"believed":[57],"that":[58,150],"stochastic":[59,156],"currently":[62],"best-known":[64],"technique":[65,90],"constraints.":[68],"a":[70,116,144],"fair":[71],"comparative":[72],"study":[73],"never":[75],"attempted":[77],"literature,":[80],"where":[81],"by":[82],"performance":[84,103,129],"both":[86,105],"constraint":[88,107],"compared":[92],"same":[95,112],"algorithm.":[97],"This":[98],"paper":[99],"fairly":[100],"compares":[101],"techniques":[109],"algorithm":[114],"set":[117],"parameters":[119],"like":[120],"rate,":[122],"successful":[123],"run,":[124],"success":[125,128],"rate":[126],"addition":[131],"objective":[133],"function":[134,139],"value":[135],"number":[137],"evaluations.":[140],"The":[141],"results":[142],"put":[143],"question":[145],"mark":[146],"belief":[149],"worse":[154],"than":[155],"ranking.":[157]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}