{"id":"https://openalex.org/W2105811042","doi":"https://doi.org/10.1109/cec.2011.5949910","title":"A nonlinear simplex search approach for multi-objective optimization","display_name":"A nonlinear simplex search approach for multi-objective optimization","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2105811042","doi":"https://doi.org/10.1109/cec.2011.5949910","mag":"2105811042"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949910","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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":["Departamento de Computaci\u00f3n, CINVESTAV, Mexico, Distrito Federal, Mexico","CINVESTAV-IPN, Departamento de Computati\u00fan, Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico"],"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, CINVESTAV, Mexico, Distrito Federal, Mexico","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"CINVESTAV-IPN, Departamento de Computati\u00fan, Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico","institution_ids":["https://openalex.org/I68368234"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047165850","display_name":"Alfredo Arias Monta\u00f1o","orcid":null},"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":"Alfredo Arias Montano","raw_affiliation_strings":["Departamento de Computaci\u00f3n, CINVESTAV, Mexico, Distrito Federal, Mexico","[CINVESTAV-IPN, Departamento de Computati\u00f3n Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico]"],"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, CINVESTAV, Mexico, Distrito Federal, Mexico","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"[CINVESTAV-IPN, Departamento de Computati\u00f3n Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico]","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/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":["Departamento de Computaci\u00f3n, UMI LAFMIA 3175, CNRS, CINVESTAV, Mexico, Distrito Federal, Mexico","CINVESTAV-IPN, Departamento de Computation and UMI LAFMIA 3175, CNRS at CINVESTAV-IPN, Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico"],"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, UMI LAFMIA 3175, CNRS, CINVESTAV, Mexico, Distrito Federal, Mexico","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"CINVESTAV-IPN, Departamento de Computation and UMI LAFMIA 3175, CNRS at CINVESTAV-IPN, Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058923986"],"corresponding_institution_ids":["https://openalex.org/I68368234"],"apc_list":null,"apc_paid":null,"fwci":1.8831,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8577175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2367","last_page":"2374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9980000257492065,"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.9951000213623047,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7420105934143066},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.7052004933357239},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.6321278214454651},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6210035085678101},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6126570701599121},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5933131575584412},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5452682375907898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5156642198562622},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4797267019748688},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4419110119342804},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4418609142303467},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.42787081003189087},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.41173046827316284},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4029625952243805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36437439918518066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3408397138118744}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7420105934143066},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7052004933357239},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6321278214454651},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6210035085678101},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6126570701599121},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5933131575584412},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5452682375907898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5156642198562622},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4797267019748688},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4419110119342804},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4418609142303467},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.42787081003189087},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.41173046827316284},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4029625952243805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36437439918518066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3408397138118744},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949910","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W71960263","https://openalex.org/W179940750","https://openalex.org/W1496840789","https://openalex.org/W1515007632","https://openalex.org/W1542437639","https://openalex.org/W1558919105","https://openalex.org/W1581562576","https://openalex.org/W1591149758","https://openalex.org/W1898293761","https://openalex.org/W1965741506","https://openalex.org/W1965748532","https://openalex.org/W1987943783","https://openalex.org/W2008499862","https://openalex.org/W2013318791","https://openalex.org/W2024008934","https://openalex.org/W2024991751","https://openalex.org/W2053313344","https://openalex.org/W2058288947","https://openalex.org/W2067498902","https://openalex.org/W2098907614","https://openalex.org/W2102365077","https://openalex.org/W2110658979","https://openalex.org/W2127218421","https://openalex.org/W2138091476","https://openalex.org/W2140691217","https://openalex.org/W2143381319","https://openalex.org/W2171074980","https://openalex.org/W4238255529","https://openalex.org/W4292864963","https://openalex.org/W6602889893","https://openalex.org/W6639348978","https://openalex.org/W6663451554","https://openalex.org/W6678914141"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W1570109187","https://openalex.org/W1583787753","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W2020093019"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"algorithm":[4,17,120],"for":[5,111],"dealing":[6],"with":[7,74,163],"nonlinear":[8,20],"and":[9,67],"unconstrained":[10],"multi-objective":[11,168],"optimization":[12],"problems":[13,83],"(MOPs).":[14],"The":[15,35,70,92,142],"proposed":[16,119],"adopts":[18],"a":[19,40,50,58,75,86,102,132,152,166],"simplex":[21,59,71],"search":[22,36,97],"scheme":[23],"in":[24,95],"order":[25],"to":[26,61,100,107,149,165],"obtain":[27],"multiple":[28,123],"approximations":[29],"of":[30,43,77,88,104,136,145],"the":[31,62,96,109,118,126,139],"Pareto":[32,140],"optimal":[33],"set.":[34],"is":[37,54,72,148],"directed":[38],"by":[39,56,65,85],"well-distributed":[41],"set":[42,76,87,103,135],"weighted":[44,47,90],"vectors.":[45,91],"Each":[46],"vector":[48],"defines":[49],"scalarization":[51,82],"problem":[52],"which":[53,79],"solved":[55],"deforming":[57],"according":[60],"movements":[63],"described":[64],"Nelder":[66],"Mead's":[68],"method.":[69],"constructed":[73],"solutions":[78,93,105,137],"minimize":[80],"different":[81,127],"defined":[84],"neighbor":[89],"found":[94],"are":[98],"used":[99],"update":[101],"considered":[106],"be":[108,161],"minima":[110],"each":[112],"separate":[113],"problem.":[114],"In":[115],"this":[116,146],"way,":[117],"collectively":[121],"obtains":[122],"trade-offs":[124],"among":[125],"conflicting":[128],"objectives,":[129],"while":[130],"maintaining":[131],"well":[133],"distributed":[134],"along":[138],"front.":[141],"main":[143],"aim":[144],"work":[147],"show":[150],"that":[151],"well-designed":[153],"strategy":[154],"using":[155],"just":[156],"mathematical":[157],"programming":[158],"techniques":[159],"can":[160],"competitive":[162],"respect":[164],"state-of-the-art":[167],"evolutionary":[169],"algorithm.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}