{"id":"https://openalex.org/W2171524068","doi":"https://doi.org/10.1109/cec.2003.1299550","title":"Adding a diversity mechanism to a simple evolution strategy to solve constrained optimization problems","display_name":"Adding a diversity mechanism to a simple evolution strategy to solve constrained optimization problems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2171524068","doi":"https://doi.org/10.1109/cec.2003.1299550","mag":"2171524068"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","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/A5058469717","display_name":"Efr\u00e9n Mezura\u2010Montes","orcid":"https://orcid.org/0000-0002-1565-5267"},"institutions":[{"id":"https://openalex.org/I59361560","display_name":"Instituto Polit\u00e9cnico Nacional","ror":"https://ror.org/059sp8j34","country_code":"MX","type":"education","lineage":["https://openalex.org/I59361560"]},{"id":"https://openalex.org/I68368234","display_name":"Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional","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":"E. Mezura-Montes","raw_affiliation_strings":["Departamento de Ingegneria Electrica, CIENVESTAV-IPN, Mexico, Mexico","Departamento de Ingenier\u00eda El\u00e9ctrica. Secci\u00f3n de Computacion, CINVESTAV, Mexico, Mexico"],"affiliations":[{"raw_affiliation_string":"Departamento de Ingegneria Electrica, CIENVESTAV-IPN, Mexico, Mexico","institution_ids":["https://openalex.org/I59361560","https://openalex.org/I68368234"]},{"raw_affiliation_string":"Departamento de Ingenier\u00eda El\u00e9ctrica. Secci\u00f3n de Computacion, CINVESTAV, Mexico, Mexico","institution_ids":["https://openalex.org/I68368234"]}]},{"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/I59361560","display_name":"Instituto Polit\u00e9cnico Nacional","ror":"https://ror.org/059sp8j34","country_code":"MX","type":"education","lineage":["https://openalex.org/I59361560"]},{"id":"https://openalex.org/I68368234","display_name":"Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional","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":"C.A.C. Coello","raw_affiliation_strings":["Departamento de Ingegneria Electrica, CIENVESTAV-IPN, Mexico, Mexico","Departamento de Ingenier\u00eda El\u00e9ctrica. Secci\u00f3n de Computacion, CINVESTAV, Mexico, Mexico"],"affiliations":[{"raw_affiliation_string":"Departamento de Ingegneria Electrica, CIENVESTAV-IPN, Mexico, Mexico","institution_ids":["https://openalex.org/I59361560","https://openalex.org/I68368234"]},{"raw_affiliation_string":"Departamento de Ingenier\u00eda El\u00e9ctrica. Secci\u00f3n de Computacion, CINVESTAV, Mexico, Mexico","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058469717"],"corresponding_institution_ids":["https://openalex.org/I59361560","https://openalex.org/I68368234"],"apc_list":null,"apc_paid":null,"fwci":4.2117,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.94433818,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":"13 Vol.1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9977999925613403,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9958000183105469,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7039612531661987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6708530187606812},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5764297246932983},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.5601711273193359},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5125517845153809},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5046766996383667},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.49220696091651917},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.47703999280929565},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4740200638771057},{"id":"https://openalex.org/keywords/mechanism","display_name":"Mechanism (biology)","score":0.45742782950401306},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.3903387784957886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22292673587799072}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7039612531661987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6708530187606812},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5764297246932983},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.5601711273193359},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5125517845153809},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5046766996383667},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.49220696091651917},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.47703999280929565},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4740200638771057},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.45742782950401306},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3903387784957886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22292673587799072},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2003.1299550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.6272","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cinvestav.mx/~constraint/papers/mezura_cec03.pdf","raw_type":"text"}],"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/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":15,"referenced_works":["https://openalex.org/W1511857018","https://openalex.org/W1529988604","https://openalex.org/W1567738939","https://openalex.org/W1826564148","https://openalex.org/W1905847227","https://openalex.org/W2038659300","https://openalex.org/W2142183404","https://openalex.org/W2145479420","https://openalex.org/W2151339633","https://openalex.org/W2155951974","https://openalex.org/W2164655924","https://openalex.org/W2167580870","https://openalex.org/W4206448558","https://openalex.org/W4301173492","https://openalex.org/W6633837800"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W2384474142","https://openalex.org/W2141887685","https://openalex.org/W3083133203","https://openalex.org/W1588199609","https://openalex.org/W2744462909","https://openalex.org/W1971520370"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"the":[5,53,62,71,88,105,108],"use":[6],"of":[7,61,73,87,104,114],"a":[8,14,31,112],"simple":[9],"evolution":[10,83],"strategy":[11],"(SES)":[12],"(i.e.,":[13],"(1":[15],"+":[16],"/spl":[17],"lambda/)-ES":[18],"with":[19,30,97],"self-adaptation":[20],"that":[21,66],"uses":[22],"three":[23],"tournament":[24],"rules":[25],"based":[26,43],"on":[27,44],"feasibility)":[28],"coupled":[29],"diversity":[32],"mechanism":[33,41],"to":[34,93,99],"solve":[35],"constrained":[36],"optimization":[37,46],"problems.":[38],"The":[39,58,85],"proposed":[40,63,89],"is":[42,65,91],"multiobjective":[45],"concepts":[47],"taken":[48],"from":[49],"an":[50,82],"approach":[51,64,90],"called":[52],"niched-Pareto":[54],"genetic":[55],"algorithm":[56],"(NPGA).":[57],"main":[59],"advantage":[60],"it":[67],"does":[68],"not":[69],"require":[70],"definition":[72],"any":[74],"extra":[75],"parameters,":[76],"other":[77,100],"than":[78],"those":[79],"required":[80],"by":[81],"strategy.":[84],"performance":[86],"shown":[92],"be":[94],"highly":[95],"competitive":[96],"respect":[98],"constraint-handling":[101],"techniques":[102],"representative":[103],"state-of-the-art":[106],"in":[107],"area":[109],"when":[110],"using":[111],"set":[113],"well-known":[115],"benchmarks.":[116]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}