{"id":"https://openalex.org/W1971497953","doi":"https://doi.org/10.1109/cec.2012.6256448","title":"A new archive based steady state genetic algorithm","display_name":"A new archive based steady state genetic algorithm","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1971497953","doi":"https://doi.org/10.1109/cec.2012.6256448","mag":"1971497953"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 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/A5021986142","display_name":"Kaustuv Nag","orcid":"https://orcid.org/0000-0002-9368-758X"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kaustuv Nag","raw_affiliation_strings":["Department of CSE, National Institute of Technology, Durgapur, Durgapur, India","Dept. of CSE, Nat. Inst. of Technol., Durgapur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CSE, National Institute of Technology, Durgapur, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]},{"raw_affiliation_string":"Dept. of CSE, Nat. Inst. of Technol., Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039040767","display_name":"Tandra Pal","orcid":"https://orcid.org/0000-0001-7494-9516"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tandra Pal","raw_affiliation_strings":["Department of CSE, National Institute of Technology, Durgapur, Durgapur, India","Dept. of CSE, Nat. Inst. of Technol., Durgapur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CSE, National Institute of Technology, Durgapur, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]},{"raw_affiliation_string":"Dept. of CSE, Nat. Inst. of Technol., Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3892,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8049621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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":1.0,"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.9988999962806702,"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.9952999949455261,"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/crossover","display_name":"Crossover","score":0.8254168629646301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6222672462463379},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6186598539352417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6179301738739014},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6119509935379028},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6019669771194458},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5980334281921387},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5480303764343262},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.508567214012146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46947726607322693},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.455394446849823},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.4547121524810791},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.44182518124580383},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.4241184890270233},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.422295480966568},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4156588912010193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25968337059020996},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16952666640281677}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8254168629646301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6222672462463379},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6186598539352417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6179301738739014},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6119509935379028},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6019669771194458},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5980334281921387},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5480303764343262},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.508567214012146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46947726607322693},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.455394446849823},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.4547121524810791},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.44182518124580383},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.4241184890270233},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.422295480966568},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4156588912010193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25968337059020996},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16952666640281677},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2012.6256448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","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":34,"referenced_works":["https://openalex.org/W46478508","https://openalex.org/W225560312","https://openalex.org/W1504943474","https://openalex.org/W1544309315","https://openalex.org/W1584075766","https://openalex.org/W1584555100","https://openalex.org/W1585939719","https://openalex.org/W1595159159","https://openalex.org/W1595498733","https://openalex.org/W1966253115","https://openalex.org/W1968535060","https://openalex.org/W1993530334","https://openalex.org/W2008002935","https://openalex.org/W2031232041","https://openalex.org/W2031946900","https://openalex.org/W2033563039","https://openalex.org/W2036005773","https://openalex.org/W2072782187","https://openalex.org/W2102365077","https://openalex.org/W2105511939","https://openalex.org/W2106334424","https://openalex.org/W2113058275","https://openalex.org/W2117444972","https://openalex.org/W2124180027","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2146446525","https://openalex.org/W2156221357","https://openalex.org/W2170766832","https://openalex.org/W2345220160","https://openalex.org/W6608886761","https://openalex.org/W6634852054","https://openalex.org/W6677467926","https://openalex.org/W6681822056"],"related_works":["https://openalex.org/W1985939653","https://openalex.org/W1606499289","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233"],"abstract_inverted_index":{"In":[0,78],"this":[1,32,79,120],"paper":[2],"we":[3,81],"have":[4,82],"proposed":[5,83,118,123],"a":[6,62,84,89],"new":[7,85,90,111],"archive":[8,25,44],"based":[9],"steady":[10],"state":[11],"multi-objective":[12,132],"genetic":[13],"algorithm,":[14],"which":[15,34],"performs":[16],"well,":[17],"especially":[18],"in":[19,31,41,56,99,119],"higher":[20],"dimensional":[21],"space.":[22],"An":[23],"improved":[24],"maintenance":[26,45],"strategy":[27,46],"has":[28,115,125],"been":[29,117,126],"introduced":[30],"algorithm":[33,80,124,140],"is":[35],"adaptive":[36],"as":[37,39],"well":[38],"dynamic":[40],"size.":[42],"The":[43,93,122],"tries":[47],"to":[48,74,152],"maintain":[49],"only":[50],"the":[51,57,68,76,97,105,142],"set":[52],"of":[53,65,107],"nondominated":[54,69],"solutions":[55,70],"archive.":[58],"However,":[59],"it":[60],"maintains":[61],"minimum":[63],"size":[64],"population":[66],"when":[67],"are":[71],"not":[72],"sufficient":[73],"fill":[75],"population.":[77],"environmental":[86],"selection":[87,95],"and":[88,137,150],"mating":[91,94],"selection.":[92],"reduces":[96],"exploration":[98],"less":[100],"probable":[101],"search":[102],"region":[103],"enhancing":[104],"exploitation":[106],"existing":[108,131],"solutions.":[109],"A":[110],"crossover":[112],"operator":[113],"DE-3":[114],"also":[116],"article.":[121],"compared":[127],"with":[128],"three":[129,144],"other":[130,143],"optimization":[133],"algorithms":[134,145],"NSGA-II,":[135],"SPEA2":[136],"AbYSS.":[138],"Our":[139],"outperforms":[141],"for":[146],"its":[147],"better":[148],"diversity":[149],"convergence":[151],"true":[153],"Pareto":[154],"optimal":[155],"front.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}