{"id":"https://openalex.org/W2821030995","doi":"https://doi.org/10.1145/3205651.3208263","title":"Computationally efficient local optima network construction","display_name":"Computationally efficient local optima network construction","publication_year":2018,"publication_date":"2018-07-06","ids":{"openalex":"https://openalex.org/W2821030995","doi":"https://doi.org/10.1145/3205651.3208263","mag":"2821030995"},"language":"en","primary_location":{"id":"doi:10.1145/3205651.3208263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205651.3208263","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":null,"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, UK"],"affiliations":[{"raw_affiliation_string":"University of Exeter, UK","institution_ids":["https://openalex.org/I23923803"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065868865"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":null,"apc_paid":null,"fwci":2.3704,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88210591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1481","last_page":"1488"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12611","display_name":"Neural Networks and Reservoir Computing","score":0.996999979019165,"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/T10299","display_name":"Photonic and Optical Devices","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/computer-science","display_name":"Computer science","score":0.7598387002944946},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.6322674751281738},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6255924701690674},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6061212420463562},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5721307992935181},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5151482820510864},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45978572964668274},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.45359793305397034},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.43809768557548523},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4256567656993866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2871909737586975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12127670645713806},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11482679843902588}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7598387002944946},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.6322674751281738},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6255924701690674},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6061212420463562},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5721307992935181},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5151482820510864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45978572964668274},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.45359793305397034},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.43809768557548523},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4256567656993866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2871909737586975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12127670645713806},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11482679843902588},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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":3,"locations":[{"id":"doi:10.1145/3205651.3208263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205651.3208263","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:figshare.com:article/29743214","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"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/32626","is_oa":false,"landing_page_url":"http://hdl.handle.net/10871/32626","pdf_url":null,"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 paper"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/29743214","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"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1934935867","display_name":null,"funder_award_id":"Engineering and Physical Sciences R","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"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/F4320320275","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1411006099","https://openalex.org/W1571491222","https://openalex.org/W2064164319","https://openalex.org/W2073347800","https://openalex.org/W2133291040","https://openalex.org/W2137246147","https://openalex.org/W2161032864","https://openalex.org/W2343683370","https://openalex.org/W2527572108","https://openalex.org/W2620219518"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W17155033"],"abstract_inverted_index":{"There":[0],"has":[1],"been":[2],"an":[3],"increasing":[4],"amount":[5],"of":[6,11,17,34,41,59,78,96,114,120,139,161],"research":[7],"on":[8,65,132],"the":[9,15,32,46,60,76,93,115,118,140,149],"visualisation":[10],"search":[12],"landscapes":[13],"through":[14],"use":[16],"exact":[18,98],"and":[19,71,83,99,102,124,136],"approximate":[20,100],"local":[21],"optima":[22],"networks":[23],"(LONs).":[24],"Although":[25],"there":[26,37],"are":[27,164],"many":[28,157],"papers":[29],"available":[30],"describing":[31],"construction":[33],"a":[35,39,50,56],"LON,":[36],"is":[38],"dearth":[40],"code":[42,106],"released":[43],"to":[44,69,75,153],"support":[45],"general":[47],"practitioner":[48],"constructing":[49],"LON":[51],"for":[52,92],"their":[53],"problem.":[54],"Furthermore,":[55],"naive":[57,154],"implementation":[58],"algorithms":[61,91],"described":[62],"in":[63,117],"work":[64],"LONs":[66],"will":[67],"lead":[68],"inefficient":[70],"costly":[72],"code,":[73],"due":[74],"possibility":[77],"repeatedly":[79],"reevaluating":[80],"neighbourhood":[81],"members,":[82],"partially":[84],"overlapping":[85],"greedy":[86,122],"paths.":[87],"Here":[88],"we":[89],"discuss":[90],"efficient":[94],"computation":[95],"both":[97],"LONs,":[101],"provide":[103,110],"open":[104],"source":[105],"online.":[107],"We":[108],"also":[109],"some":[111],"empirical":[112],"illustrations":[113],"reduction":[116],"number":[119],"recursive":[121],"calls,":[123],"quality":[125],"function":[126],"calls":[127],"that":[128],"can":[129],"be":[130],"obtained":[131],"NK":[133],"model":[134],"landscapes,":[135],"discretised":[137],"versions":[138],"IEEE":[141],"CEC":[142],"2013":[143],"niching":[144],"competition":[145],"tests":[146],"functions,":[147],"using":[148],"developed":[150],"framework":[151],"compared":[152],"implementations.":[155],"In":[156],"instances":[158],"multiple":[159],"order":[160],"magnitude":[162],"improvements":[163],"observed.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}