{"id":"https://openalex.org/W1972283285","doi":"https://doi.org/10.1145/2464576.2464633","title":"An efficient constraint handling approach for optimization problems with limited feasibility and computationally expensive constraint evaluations","display_name":"An efficient constraint handling approach for optimization problems with limited feasibility and computationally expensive constraint evaluations","publication_year":2013,"publication_date":"2013-07-06","ids":{"openalex":"https://openalex.org/W1972283285","doi":"https://doi.org/10.1145/2464576.2464633","mag":"1972283285"},"language":"en","primary_location":{"id":"doi:10.1145/2464576.2464633","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2464576.2464633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference companion 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/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/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Md Asafuddoula","raw_affiliation_strings":["UNSW ADFA, Canberra, Australia","UNSW ADFA, Canberra, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia","institution_ids":["https://openalex.org/I40053085"]},{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"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/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tapabrata Ray","raw_affiliation_strings":["UNSW ADFA, Canberra, Australia","UNSW ADFA, Canberra, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia","institution_ids":["https://openalex.org/I40053085"]},{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"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/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ruhul Sarker","raw_affiliation_strings":["UNSW ADFA, Canberra, Australia","UNSW ADFA, Canberra, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia","institution_ids":["https://openalex.org/I40053085"]},{"raw_affiliation_string":"UNSW ADFA, Canberra, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06184636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"114"},"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.9976000189781189,"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.9965999722480774,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.8242528438568115},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7501626014709473},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6629889011383057},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5980678200721741},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.5747050642967224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5510165095329285},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5293850302696228},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4998507499694824},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4953228533267975},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4592750668525696},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.44133251905441284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30795013904571533},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.13578283786773682},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08016753196716309}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.8242528438568115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7501626014709473},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6629889011383057},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5980678200721741},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5747050642967224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5510165095329285},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5293850302696228},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4998507499694824},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4953228533267975},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4592750668525696},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.44133251905441284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30795013904571533},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.13578283786773682},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08016753196716309},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2464576.2464633","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2464576.2464633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual conference companion on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W125458924","https://openalex.org/W1539702957","https://openalex.org/W1998674867","https://openalex.org/W2048810930","https://openalex.org/W2107782179","https://openalex.org/W2139747021","https://openalex.org/W2145479420","https://openalex.org/W2149454052","https://openalex.org/W2151339633","https://openalex.org/W2167580870","https://openalex.org/W3137715965","https://openalex.org/W6632395772"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2360238382","https://openalex.org/W1536604285","https://openalex.org/W2334636689","https://openalex.org/W1531664660","https://openalex.org/W1567852657","https://openalex.org/W1493198162","https://openalex.org/W1519282274","https://openalex.org/W3189630375","https://openalex.org/W1547011777"],"abstract_inverted_index":{"Existing":[0],"optimization":[1],"approaches":[2],"adopt":[3],"a":[4,14,24,41,51,63,91,116],"full":[5],"evaluation":[6,29,58],"policy,":[7],"i.e.":[8,75],"all":[9,33],"the":[10,19,34,57,76,82,94,100,103,136,141],"constraints":[11,55,80,89],"corresponding":[12],"to":[13],"solution":[15,48],"are":[16,69,123],"evaluated":[17],"throughout":[18],"course":[20],"of":[21,27,43,54,78,87,96,102,118],"search.":[22],"Furthermore,":[23],"common":[25],"sequence":[26,53],"constraint":[28,44,64,112],"is":[30,49,60,65],"used":[31],"for":[32,129],"solutions.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39],"introduce":[40],"scheme":[42,105],"handling,":[45],"wherein":[46],"every":[47],"assigned":[50],"random":[52],"and":[56,81,106],"process":[59],"aborted":[61],"whenever":[62],"violated.":[66],"The":[67,85,121,132],"solutions":[68],"sorted":[70],"based":[71],"on":[72],"two":[73],"measures":[74],"number":[77,86],"satisfied":[79,88],"violation":[83],"measure.":[84],"takes":[90],"precedence":[92],"over":[93],"amount":[95],"violation.":[97],"We":[98],"illustrate":[99],"performance":[101],"proposed":[104,142],"compare":[107],"it":[108],"with":[109],"other":[110],"state-of-the-art":[111],"handling":[113],"methods":[114],"within":[115],"framework":[117],"differential":[119],"evolution.":[120],"results":[122,133],"compared":[124],"using":[125],"gseries":[126],"test":[127],"functions":[128],"inequality":[130],"constraints.":[131],"clearly":[134],"highlight":[135],"potential":[137],"savings":[138],"offered":[139],"by":[140],"method":[143]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}