{"id":"https://openalex.org/W1482100023","doi":"https://doi.org/10.1109/cec.2015.7257000","title":"MVMO for bound constrained single-objective computationally expensive numerical optimization","display_name":"MVMO for bound constrained single-objective computationally expensive numerical optimization","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1482100023","doi":"https://doi.org/10.1109/cec.2015.7257000","mag":"1482100023"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7257000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on 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/A5056386814","display_name":"Jos\u00e9 L. Rueda","orcid":"https://orcid.org/0000-0001-7288-0228"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jose L. Rueda","raw_affiliation_strings":["Department of Electrical Sustainable Energy Delft University of Technology, Delft, The Netherlands","Dept. of Electrical Sustainable Energy Delft University of Technology The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Sustainable Energy Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Dept. of Electrical Sustainable Energy Delft University of Technology The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077323202","display_name":"I. Erlich","orcid":"https://orcid.org/0000-0003-0910-1732"},"institutions":[{"id":"https://openalex.org/I62318514","display_name":"University of Duisburg-Essen","ror":"https://ror.org/04mz5ra38","country_code":"DE","type":"education","lineage":["https://openalex.org/I62318514"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Istvan Erlich","raw_affiliation_strings":["Institute of Electrical Power Systems, University Duisburg-Essen, Duisburg, Germany","Institute of Electrical Power Systems - University Duisburg-Essen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Electrical Power Systems, University Duisburg-Essen, Duisburg, Germany","institution_ids":["https://openalex.org/I62318514"]},{"raw_affiliation_string":"Institute of Electrical Power Systems - University Duisburg-Essen, Germany","institution_ids":["https://openalex.org/I62318514"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8147,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.96376766,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1011","last_page":"1017"},"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.9993000030517578,"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.987500011920929,"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.6538171172142029},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.5866264700889587},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5763826966285706},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5735569000244141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5298746824264526},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5140088796615601},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.513450026512146},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.44410115480422974},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41962334513664246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3919488191604614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3829129636287689},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.2218438684940338},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06777799129486084}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6538171172142029},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.5866264700889587},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5763826966285706},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5735569000244141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5298746824264526},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5140088796615601},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.513450026512146},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.44410115480422974},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41962334513664246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3919488191604614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3829129636287689},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2218438684940338},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06777799129486084},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2015.7257000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1965506799","https://openalex.org/W1978323924","https://openalex.org/W1979575344","https://openalex.org/W2083102684","https://openalex.org/W2099073487","https://openalex.org/W2138699280","https://openalex.org/W2482791116","https://openalex.org/W4230383563","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2411867243","https://openalex.org/W2186293978","https://openalex.org/W3217122477","https://openalex.org/W2907206257","https://openalex.org/W2037054133","https://openalex.org/W3005470947","https://openalex.org/W2943947911","https://openalex.org/W2792234022","https://openalex.org/W2916085971","https://openalex.org/W2189268627"],"abstract_inverted_index":{"Mean-Variance":[0],"Mapping":[1],"Optimization":[2],"(MVMO)":[3],"is":[4,71],"a":[5,25,32,50,104,137],"recent":[6],"addition":[7],"to":[8,74,102],"the":[9,22,36,47,57,63,88,113],"heuristic":[10],"optimization":[11,41,65,116],"field.":[12],"The":[13],"main":[14],"traits":[15],"of":[16,24,35,49,62,90,140],"its":[17,95],"evolutionary":[18],"mechanism":[19],"reside":[20],"in":[21,46,94],"adoption":[23],"single":[26],"parent-offspring":[27],"pair":[28],"approach":[29],"along":[30],"with":[31,79],"normalized":[33,64],"range":[34],"search":[37,106],"space":[38],"for":[39,56,67],"all":[40],"variables":[42,66],"as":[43,45],"well":[44],"use":[48],"special":[51],"mapping":[52],"function,":[53],"which":[54],"accounts":[55],"actual":[58],"mean":[59],"and":[60,77,99],"variance":[61],"mutation":[68],"operation.":[69],"MVMO":[70,91,128],"also":[72],"open":[73],"further":[75],"extensions":[76],"hybridization":[78],"other":[80],"approaches.":[81],"Along":[82],"this":[83,85],"spirit,":[84],"paper":[86],"surveys":[87],"performance":[89],"when":[92,100],"executed":[93],"pure":[96],"algorithmic":[97],"procedure":[98],"hybridized":[101],"include":[103],"local":[105],"strategy.":[107],"Numerical":[108],"experiments":[109],"are":[110],"conducted":[111],"on":[112,119],"IEEE-CEC":[114],"2015":[115],"test":[117],"bed":[118],"bound":[120],"constrained":[121],"single-objective":[122],"computationally":[123],"expensive":[124],"numerical":[125],"optimization.":[126],"Remarkably,":[127],"proves":[129],"effective":[130],"at":[131],"solving":[132],"different":[133],"complex":[134],"problems":[135],"within":[136],"reduced":[138],"number":[139],"allowed":[141],"function":[142],"evaluations.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
