{"id":"https://openalex.org/W3184248748","doi":"https://doi.org/10.1109/cec45853.2021.9504708","title":"If You Can\u2019t Beat It, Squash It: Simplify Global Optimization by Evolving Dilation Functions","display_name":"If You Can\u2019t Beat It, Squash It: Simplify Global Optimization by Evolving Dilation Functions","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3184248748","doi":"https://doi.org/10.1109/cec45853.2021.9504708","mag":"3184248748"},"language":"en","primary_location":{"id":"doi:10.1109/cec45853.2021.9504708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5027486263","display_name":"Daniele M. Papetti","orcid":"https://orcid.org/0000-0002-3574-6027"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele M. Papetti","raw_affiliation_strings":["University of Milano-Bicocca, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Milano-Bicocca, Milano, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080870632","display_name":"Daniel Ashlock","orcid":"https://orcid.org/0000-0003-2209-7504"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Daniel A. Ashlock","raw_affiliation_strings":["University of Guelph, Guelph, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Guelph, Guelph, ON, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013723473","display_name":"Paolo Cazzaniga","orcid":"https://orcid.org/0000-0001-7780-0434"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Cazzaniga","raw_affiliation_strings":["University of Bergamo, Bergamo, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072712347","display_name":"Daniela Besozzi","orcid":"https://orcid.org/0000-0001-5532-3059"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniela Besozzi","raw_affiliation_strings":["Bicocca Bioinformatics, Biostatistics and Bioimaging Centre - B4, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bicocca Bioinformatics, Biostatistics and Bioimaging Centre - B4, Milano, Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043650939","display_name":"Marco S. Nobile","orcid":"https://orcid.org/0000-0002-7692-7203"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marco S. Nobile","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8792,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76559784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"30","issue":null,"first_page":"1414","last_page":"1422"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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.9997000098228455,"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/T11975","display_name":"Evolutionary Algorithms and Applications","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6242510080337524},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5900375247001648},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5673147439956665},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5229045748710632},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.48307135701179504},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.48277297616004944},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4166506230831146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33666175603866577},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2696802616119385},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2452457845211029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24201804399490356}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6242510080337524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5900375247001648},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5673147439956665},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5229045748710632},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.48307135701179504},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.48277297616004944},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4166506230831146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33666175603866577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2696802616119385},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2452457845211029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24201804399490356}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/cec45853.2021.9504708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/afe8d42c-5dc5-490f-b9b5-c6e04a698867","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/afe8d42c-5dc5-490f-b9b5-c6e04a698867","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Papetti, D M, Ashlock, D A, Cazzaniga, P, Besozzi, D & Nobile, M S 2021, If You Can't Beat It, Squash It : Simplify Global Optimization by Evolving Dilation Functions. in 2021 IEEE Congress on Evolutionary Computation (CEC)., 9504708, Institute of Electrical and Electronics Engineers, pp. 1414-1422, 2021 IEEE Congress on Evolutionary Computation, CEC 2021, Krakow, Poland, 28/06/21. https://doi.org/10.1109/CEC45853.2021.9504708","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aisberg.unibg.it:10446/206632","is_oa":false,"landing_page_url":"http://hdl.handle.net/10446/206632","pdf_url":null,"source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:boa.unimib.it:10281/319526","is_oa":false,"landing_page_url":"http://hdl.handle.net/10281/319526","pdf_url":null,"source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:iris.unive.it:10278/5004822","is_oa":false,"landing_page_url":"http://hdl.handle.net/10278/5004822","pdf_url":null,"source":{"id":"https://openalex.org/S4306402336","display_name":"ARCA (Universit\u00e0 Ca' Foscari Venezia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149461666","host_organization_name":"Ca' Foscari University of Venice","host_organization_lineage":["https://openalex.org/I149461666"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/afe8d42c-5dc5-490f-b9b5-c6e04a698867","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/afe8d42c-5dc5-490f-b9b5-c6e04a698867","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC), 1414 - 1422","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W102487131","https://openalex.org/W145413376","https://openalex.org/W200204928","https://openalex.org/W1576660662","https://openalex.org/W1595159159","https://openalex.org/W1918176521","https://openalex.org/W1980394920","https://openalex.org/W2049383133","https://openalex.org/W2051762777","https://openalex.org/W2057443096","https://openalex.org/W2110368321","https://openalex.org/W2119401655","https://openalex.org/W2128010900","https://openalex.org/W2143560894","https://openalex.org/W2402846924","https://openalex.org/W2543580944","https://openalex.org/W2565923887","https://openalex.org/W2588907814","https://openalex.org/W2609401777","https://openalex.org/W2751846886","https://openalex.org/W2756260525","https://openalex.org/W2771933684","https://openalex.org/W2885166485","https://openalex.org/W2897300524","https://openalex.org/W2946085841","https://openalex.org/W2967895064","https://openalex.org/W3009038870","https://openalex.org/W3110938109","https://openalex.org/W6786827568"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2890524932","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W4375949242","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875"],"abstract_inverted_index":{"Optimization":[0,24],"problems":[1,25],"represent":[2],"a":[3,20,120,136,166],"class":[4],"of":[5,19,36,43,60,81,94,100,129,151,159,168,179],"pervasive":[6],"and":[7,32,91,144,156],"complex":[8],"tasks":[9],"in":[10,85],"Computer":[11],"Science,":[12],"aimed":[13],"at":[14],"identifying":[15],"the":[16,41,50,58,61,82,89,109,127,131,149,154,157,180],"global":[17],"optimum":[18],"given":[21],"objective":[22],"function.":[23],"are":[26],"typically":[27],"noisy,":[28],"multi-modal,":[29],"non-convex,":[30],"non-separable,":[31],"often":[33],"non-differentiable.":[34],"Because":[35],"these":[37],"features,":[38],"they":[39,104],"mandate":[40],"use":[42],"sophisticated":[44],"population-based":[45],"meta-heuristics":[46],"to":[47,73,87,122,147],"effectively":[48,71],"explore":[49],"search":[51,83],"space.":[52],"Additionally,":[53],"computational":[54],"techniques":[55],"based":[56,125],"on":[57,108,126,165],"manipulation":[59],"optimization":[62,111,182],"landscape,":[63],"such":[64],"as":[65],"Dilation":[66],"Functions":[67],"(DFs),":[68],"can":[69],"be":[70,106],"exploited":[72],"either":[74],"\"compress\"":[75],"or":[76],"\"dilate\"":[77],"some":[78],"target":[79],"regions":[80],"space,":[84],"order":[86],"improve":[88],"exploration":[90],"exploitation":[92],"capabilities":[93],"any":[95],"meta-heuristic.":[96],"The":[97],"main":[98],"limitation":[99],"DFs":[101,164],"is":[102],"that":[103,172],"must":[105],"tailored":[107],"specific":[110],"problem":[112],"under":[113],"investigation.":[114],"In":[115],"this":[116,123,173],"work,":[117],"we":[118,134],"propose":[119],"solution":[121],"issue,":[124],"idea":[128],"evolving":[130],"DFs.":[132,160],"Specifically,":[133],"introduce":[135],"two-layered":[137],"evolutionary":[138],"framework,":[139],"which":[140],"combines":[141],"Evolutionary":[142],"Computation":[143],"Swarm":[145],"Intelligence":[146],"solve":[148],"meta-problem":[150],"optimizing":[152],"both":[153],"structure":[155],"parameters":[158],"We":[161],"evolved":[162],"optimal":[163],"variety":[167],"benchmark":[169],"problems,":[170],"showing":[171],"approach":[174],"yields":[175],"extremely":[176],"simpler":[177],"versions":[178],"original":[181],"problems.":[183]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2021-08-02T00:00:00"}