{"id":"https://openalex.org/W2135180432","doi":"https://doi.org/10.1109/cec.2010.5586462","title":"An archiving strategy based on the Convex Hull of Individual Minima for MOEAs","display_name":"An archiving strategy based on the Convex Hull of Individual Minima for MOEAs","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2135180432","doi":"https://doi.org/10.1109/cec.2010.5586462","mag":"2135180432"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5058923986","display_name":"Sa\u00fal Zapotecas\u2013Mart\u00ednez","orcid":"https://orcid.org/0000-0003-1281-9040"},"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":"Saul Zapotecas Martinez","raw_affiliation_strings":["CINVESTAV-IPN, Departamento de Computaci\u00f3n (Evolutionary Computation Group), M\u00e9xico, D.F., MEXICO","Departamento de Computaci\u00f3n, Evolutionary Computation Group, Mexicali, Mexico"],"affiliations":[{"raw_affiliation_string":"CINVESTAV-IPN, Departamento de Computaci\u00f3n (Evolutionary Computation Group), M\u00e9xico, D.F., MEXICO","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"Departamento de Computaci\u00f3n, Evolutionary Computation Group, Mexicali, Mexico","institution_ids":[]}]},{"author_position":"last","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":false,"raw_author_name":"Carlos A. Coello Coello","raw_affiliation_strings":["CINVESTAV-IPN, Departamento de Computaci\u00f3n (Evolutionary Computation Group), M\u00e9xico, D.F., MEXICO","UMI LAFMIA 3175 CNRS at CINVESTAV-IPN, Mexicali, Mexico"],"affiliations":[{"raw_affiliation_string":"CINVESTAV-IPN, Departamento de Computaci\u00f3n (Evolutionary Computation Group), M\u00e9xico, D.F., MEXICO","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"UMI LAFMIA 3175 CNRS at CINVESTAV-IPN, Mexicali, Mexico","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058923986"],"corresponding_institution_ids":["https://openalex.org/I68368234"],"apc_list":null,"apc_paid":null,"fwci":0.3345,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.6378663,"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":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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.8138452768325806},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7630326151847839},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6413166522979736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5777891874313354},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5395400524139404},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.4985682964324951},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4578278660774231},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4100261628627777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33380961418151855},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06140759587287903}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.8138452768325806},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7630326151847839},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6413166522979736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5777891874313354},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5395400524139404},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.4985682964324951},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4578278660774231},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4100261628627777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33380961418151855},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06140759587287903},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1109/cec.2010.5586462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321739","display_name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","ror":"https://ror.org/059ex5q34"},{"id":"https://openalex.org/F4320322835","display_name":"Ministry of Economic Affairs","ror":"https://ror.org/042ge0913"},{"id":"https://openalex.org/F4320335331","display_name":"Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional","ror":"https://ror.org/059sp8j34"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1491237923","https://openalex.org/W1534737284","https://openalex.org/W1542437639","https://openalex.org/W1553373771","https://openalex.org/W1558919105","https://openalex.org/W1572960541","https://openalex.org/W1573713091","https://openalex.org/W1581562576","https://openalex.org/W1585335425","https://openalex.org/W1585939719","https://openalex.org/W1591149758","https://openalex.org/W1612556207","https://openalex.org/W1905847227","https://openalex.org/W2003409240","https://openalex.org/W2024008934","https://openalex.org/W2053900989","https://openalex.org/W2099389646","https://openalex.org/W2102365077","https://openalex.org/W2116661285","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2165626989","https://openalex.org/W2261054240","https://openalex.org/W2408724137","https://openalex.org/W2495684637","https://openalex.org/W4242952145","https://openalex.org/W6631966725","https://openalex.org/W6634239536","https://openalex.org/W6635097213","https://openalex.org/W6636658889"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W2909957174","https://openalex.org/W3188646203","https://openalex.org/W136674370","https://openalex.org/W2105527480","https://openalex.org/W4320035781","https://openalex.org/W2052387497","https://openalex.org/W4246278799","https://openalex.org/W2050203848"],"abstract_inverted_index":{"Diversity":[0],"plays":[1],"an":[2,84,93],"important":[3,94],"role":[4],"in":[5],"evolutionary":[6,33],"multi-objective":[7,32],"optimization.":[8],"Because":[9],"of":[10,14,31,74,96,123],"this,":[11],"a":[12,114],"number":[13],"density":[15,45],"estimators":[16],"(i.e.,":[17],"mechanisms":[18],"that":[19],"help":[20],"to":[21,67,77,99,109,134],"maintain":[22],"diversity)":[23],"have":[24],"been":[25],"proposed":[26,128],"since":[27],"the":[28,42,60,72,79,120,150],"early":[29],"days":[30],"algorithms":[34],"(MOEAs).":[35],"Fitness":[36],"sharing":[37],"and":[38,139,145],"niching":[39],"were":[40],"among":[41],"most":[43],"popular":[44],"estimator":[46],"used":[47],"with":[48,132],"non-elitist":[49],"MOEAs,":[50],"but":[51],"their":[52,56],"main":[53],"drawback":[54],"was":[55,64],"high":[57],"dependence":[58],"on":[59,119],"niche":[61],"radius,":[62],"which":[63],"normally":[65],"difficult":[66],"set.":[68],"In":[69,104],"recent":[70],"years,":[71],"use":[73],"external":[75],"archives":[76],"store":[78],"nondominated":[80],"solutions":[81],"found":[82],"by":[83,112],"elitist":[85],"MOEA":[86],"has":[87,91],"become":[88],"popular.":[89],"This":[90],"motivated":[92],"amount":[95],"research":[97],"related":[98],"archiving":[100,116],"techniques":[101],"for":[102],"MOEAs.":[103],"this":[105],"paper,":[106],"we":[107],"contribute":[108],"such":[110],"literature":[111],"introducing":[113],"new":[115],"strategy":[117],"based":[118],"Convex":[121],"Hull":[122],"Individual":[124],"Minima":[125],"(CHIM).":[126],"Our":[127],"approach":[129],"is":[130],"compared":[131],"respect":[133],"two":[135],"competitive":[136],"MOEAs":[137],"(NSGA-II":[138],"SPEA2)":[140],"using":[141],"standard":[142],"test":[143],"problems":[144],"performance":[146],"measures":[147],"taken":[148],"from":[149],"specialized":[151],"literature.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}