{"id":"https://openalex.org/W2956768389","doi":"https://doi.org/10.1109/cec.2019.8790124","title":"A Memetic Approach to the Solution of Constrained Min-Max Problems","display_name":"A Memetic Approach to the Solution of Constrained Min-Max Problems","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2956768389","doi":"https://doi.org/10.1109/cec.2019.8790124","mag":"2956768389"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8790124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5088443208","display_name":"Gianluca Filippi","orcid":"https://orcid.org/0000-0001-7393-905X"},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gianluca Filippi","raw_affiliation_strings":["Mechanical and Aerospace Engineering, University of Strathclyde, Glasgow, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of Strathclyde, Glasgow, UK","institution_ids":["https://openalex.org/I181647926"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036136239","display_name":"Massimiliano Vasile","orcid":"https://orcid.org/0000-0001-8302-6465"},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Massimiliano Vasile","raw_affiliation_strings":["Mechanical and Aerospace Engineering, University of Strathclyde, Glasgow, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of Strathclyde, Glasgow, UK","institution_ids":["https://openalex.org/I181647926"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181647926"],"apc_list":null,"apc_paid":null,"fwci":9.9781,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.98766603,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"506","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.991100013256073,"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/T11053","display_name":"Process Optimization and Integration","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimisation","display_name":"Minimisation (clinical trials)","score":0.7857517004013062},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7730082273483276},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.6997395157814026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5132107734680176},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4248761236667633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4232231378555298},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.22431039810180664}],"concepts":[{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.7857517004013062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7730082273483276},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6997395157814026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5132107734680176},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4248761236667633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4232231378555298},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.22431039810180664},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2019.8790124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:strathprints.strath.ac.uk:68668","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/view/author/1159487.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W570478005","https://openalex.org/W1544606593","https://openalex.org/W1601972095","https://openalex.org/W1964182072","https://openalex.org/W1985162440","https://openalex.org/W1993377828","https://openalex.org/W2002358177","https://openalex.org/W2010978740","https://openalex.org/W2024370928","https://openalex.org/W2035674537","https://openalex.org/W2047039242","https://openalex.org/W2056270382","https://openalex.org/W2074145420","https://openalex.org/W2078289947","https://openalex.org/W2080793066","https://openalex.org/W2085052252","https://openalex.org/W2104262066","https://openalex.org/W2114822196","https://openalex.org/W2115114028","https://openalex.org/W2122107228","https://openalex.org/W2128330915","https://openalex.org/W2136954673","https://openalex.org/W2614367549","https://openalex.org/W2810851478","https://openalex.org/W2980487008","https://openalex.org/W3098955026","https://openalex.org/W4249759900","https://openalex.org/W6632735913","https://openalex.org/W6636208199","https://openalex.org/W6650812375"],"related_works":["https://openalex.org/W2087670438","https://openalex.org/W4200095921","https://openalex.org/W4213209435","https://openalex.org/W4297093299","https://openalex.org/W2014867304","https://openalex.org/W2287481702","https://openalex.org/W2384528180","https://openalex.org/W2018753201","https://openalex.org/W2956768389","https://openalex.org/W2557096003"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,32],"novel":[4],"memetic":[5],"algorithm":[6],"for":[7,104],"the":[8,17,29,37,46,63,67,74,92,98,109],"solution":[9,51,100],"of":[10,20,31,34,39,66,69,91,108],"constrained":[11],"min-max":[12],"problems":[13],"that":[14,62,101],"derive":[15],"from":[16],"optimal":[18,55],"design":[19,56,99],"complex":[21],"systems":[22],"under":[23,52],"worst-case":[24,47,50,64],"conditions.":[25],"In":[26,73],"this":[27],"context":[28],"maximisation":[30,79],"quantity":[33,68],"interest":[35,70],"over":[36],"space":[38],"uncertain":[40,110],"variables":[41],"is":[42,58,71,95,102],"required":[43],"to":[44,84,96],"identify":[45,97],"scenario":[48],"(or":[49],"uncertainty).":[53],"An":[54],"vector":[57],"then":[59],"identified":[60],"such":[61],"value":[65],"minimised.":[72],"most":[75],"general":[76],"case,":[77],"both":[78],"and":[80],"minimisation":[81,93],"are":[82],"subject":[83],"strict":[85],"feasibility":[86],"constraints.":[87],"The":[88],"ultimate":[89],"goal":[90],"problem":[94],"feasible":[103],"all":[105],"possible":[106],"values":[107],"parameters.":[111]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}