{"id":"https://openalex.org/W2940525133","doi":"https://doi.org/10.1145/3319619.3326838","title":"Visualising the landscape of multi-objective problems using local optima networks","display_name":"Visualising the landscape of multi-objective problems using local optima networks","publication_year":2019,"publication_date":"2019-07-10","ids":{"openalex":"https://openalex.org/W2940525133","doi":"https://doi.org/10.1145/3319619.3326838","mag":"2940525133"},"language":"en","primary_location":{"id":"doi:10.1145/3319619.3326838","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319619.3326838","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ore.exeter.ac.uk/repository/bitstream/10871/36891/3/plon_final-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065868865","display_name":"Jonathan E. Fieldsend","orcid":"https://orcid.org/0000-0002-0683-2583"},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jonathan E. Fieldsend","raw_affiliation_strings":["University of Exeter"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Exeter","institution_ids":["https://openalex.org/I23923803"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015627213","display_name":"Khulood Alyahya","orcid":null},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Khulood Alyahya","raw_affiliation_strings":["University of Exeter"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Exeter","institution_ids":["https://openalex.org/I23923803"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065868865"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":null,"apc_paid":null,"fwci":2.8571,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.90671031,"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":"1421","last_page":"1429"},"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.9972000122070312,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/local-optimum","display_name":"Local optimum","score":0.8035616874694824},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5752362012863159},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5159731507301331},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5027318000793457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4688962996006012},{"id":"https://openalex.org/keywords/fitness-landscape","display_name":"Fitness landscape","score":0.4274095594882965},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4240642189979553},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4191465973854065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3817436695098877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31563419103622437}],"concepts":[{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.8035616874694824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5752362012863159},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5159731507301331},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5027318000793457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4688962996006012},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.4274095594882965},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4240642189979553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4191465973854065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3817436695098877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31563419103622437},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3319619.3326838","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319619.3326838","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/36891","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/36891","pdf_url":"https://ore.exeter.ac.uk/repository/bitstream/10871/36891/3/plon_final-2.pdf","source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"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":"Conference proceedings"},{"id":"pmh:oai:figshare.com:article/29753813","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"Conference contribution"}],"best_oa_location":{"id":"pmh:oai:ore.exeter.ac.uk:10871/36891","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/36891","pdf_url":"https://ore.exeter.ac.uk/repository/bitstream/10871/36891/3/plon_final-2.pdf","source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"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":"Conference proceedings"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.550000011920929,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G2865109628","display_name":null,"funder_award_id":"EP/N017846/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3157446626","display_name":"The Parameter Optimisation Problem: Addressing a Key Challenge in Computational Systems Biology","funder_award_id":"EP/N017846/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2940525133.pdf","grobid_xml":"https://content.openalex.org/works/W2940525133.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1411006099","https://openalex.org/W1957430778","https://openalex.org/W1964413221","https://openalex.org/W2073819677","https://openalex.org/W2094233798","https://openalex.org/W2110517590","https://openalex.org/W2133291040","https://openalex.org/W2137246147","https://openalex.org/W2139196352","https://openalex.org/W2148278639","https://openalex.org/W2161032864","https://openalex.org/W2307604735","https://openalex.org/W2518870586","https://openalex.org/W2643418988","https://openalex.org/W2725272085","https://openalex.org/W2767528495","https://openalex.org/W2821030995","https://openalex.org/W2884866910","https://openalex.org/W2888078032","https://openalex.org/W2888161290","https://openalex.org/W2939466003"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W57712993","https://openalex.org/W2123829500","https://openalex.org/W2560221187","https://openalex.org/W2305572622","https://openalex.org/W3046481193","https://openalex.org/W2093083775","https://openalex.org/W2168643276","https://openalex.org/W2885371939","https://openalex.org/W4251252301"],"abstract_inverted_index":{"Local":[0],"optima":[1,17],"networks":[2],"(LONs)":[3],"represent":[4,15],"the":[5,19,24,32,42,94,102,159,177],"landscape":[6],"of":[7,110,118,158,180],"optimisation":[8],"problems.":[9,154],"In":[10,80],"a":[11,51,108,129,167,185,193],"LON,":[12,96],"graph":[13],"vertices":[14,31],"local":[16,137],"in":[18,163,166,187,195],"search":[20,103],"domain,":[21,174],"their":[22],"radii":[23],"basin":[25,38,78],"sizes,":[26],"and":[27,73,116],"directed":[28],"edges":[29],"between":[30,120],"ability":[33],"to":[34,39,93,100,142,171],"transit":[35],"from":[36],"one":[37],"another":[40],"(with":[41],"edge":[43],"width":[44],"denoting":[45],"how":[46],"easy":[47],"this":[48],"is).":[49],"Recently,":[50],"network":[52],"construction":[53],"approach":[54],"inspired":[55],"by":[56],"LONs":[57,124,165],"has":[58],"been":[59],"proposed":[60,197],"for":[61,87],"multi-objective":[62,168],"problems":[63,89],"which":[64,90],"uses":[65],"an":[66],"undirected":[67],"graph,":[68],"representing":[69],"mutually":[70],"non-dominating":[71],"solutions":[72],"neighbouring":[74],"links,":[75],"but":[76],"not":[77],"sizes.":[79],"contrast,":[81],"here":[82],"we":[83],"introduce":[84],"two":[85],"formulations":[86,150],"multi/many-objective":[88],"are":[91],"analogous":[92],"traditional":[95],"using":[97],"dominance-based":[98],"hill-climbing":[99],"characterise":[101],"domain.":[104],"Each":[105],"vertex":[106,186],"represents":[107,192],"set":[109,194],"locally":[111],"optimal":[112],"solutions,":[113],"with":[114,176],"basins":[115],"ease":[117],"transition":[119],"them":[121],"shown.":[122],"These":[123],"vary":[125],"depending":[126],"on":[127,151],"whether":[128],"point-based":[130],"(dominance":[131],"neutral":[132],"optima)":[133,138],"or":[134],"set-based":[135],"(Pareto":[136],"representation":[139],"is":[140],"used":[141],"define":[143],"mode":[144],"construction.":[145],"We":[146,155],"illustrate":[147],"these":[148,188],"alternative":[149],"some":[152,157],"illustrative":[153],"discuss":[156],"underlying":[160],"computational":[161],"issues":[162],"constructing":[164],"as":[169,183],"opposed":[170],"uni-objective":[172],"problem":[173],"along":[175],"inherent":[178],"issue":[179],"neutrality":[181],"-":[182],"each":[184],"graphs":[189],"almost":[190],"invariably":[191],"our":[196],"constructs.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}