{"id":"https://openalex.org/W1985448302","doi":"https://doi.org/10.1145/2576768.2598268","title":"On the efficiency of worst improvement for climbing NK-landscapes","display_name":"On the efficiency of worst improvement for climbing NK-landscapes","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W1985448302","doi":"https://doi.org/10.1145/2576768.2598268","mag":"1985448302"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","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/A5029072668","display_name":"Matthieu Basseur","orcid":"https://orcid.org/0000-0002-8285-5621"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matthieu Basseur","raw_affiliation_strings":["Universit\u00e9 d'Angers, Angers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 d'Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107415354","display_name":"Adrien Go\u00ebffon","orcid":null},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Adrien Go\u00ebffon","raw_affiliation_strings":["Universit\u00e9 d'Angers, Angers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 d'Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I49451733"],"apc_list":null,"apc_paid":null,"fwci":1.1039,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74042022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"413","last_page":"420"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9934999942779541,"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/local-optimum","display_name":"Local optimum","score":0.9007875919342041},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.8337640166282654},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7049047946929932},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6811686158180237},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6799566149711609},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6557486057281494},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5706809163093567},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4794984459877014},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.42645081877708435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3259323537349701},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17302098870277405}],"concepts":[{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.9007875919342041},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.8337640166282654},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7049047946929932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6811686158180237},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6799566149711609},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6557486057281494},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5706809163093567},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4794984459877014},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.42645081877708435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3259323537349701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17302098870277405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2576768.2598268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.4643","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.4643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.info.univ-angers.fr/pub/basseur/papers/GECCO14_BasseurGoeffon.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-03256595v1","is_oa":false,"landing_page_url":"https://univ-angers.hal.science/hal-03256595","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dl.acm.org/citation.cfm?doid=2576768.2598268","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W110496925","https://openalex.org/W1542211788","https://openalex.org/W1591939288","https://openalex.org/W1753541634","https://openalex.org/W2010334716","https://openalex.org/W2062763553","https://openalex.org/W2107951961","https://openalex.org/W2108020239","https://openalex.org/W2118311688","https://openalex.org/W2153654605","https://openalex.org/W3121748795","https://openalex.org/W4256238177","https://openalex.org/W4388252848"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W2887485518","https://openalex.org/W4386413867","https://openalex.org/W57712993","https://openalex.org/W2789338867","https://openalex.org/W2168643276","https://openalex.org/W2911754124","https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W2885371939"],"abstract_inverted_index":{"Climbers":[0],"are":[1,84],"often":[2,43,126],"used":[3,100],"in":[4,6,36,61,86,108,152],"metaheuristics":[5,59],"order":[7],"to":[8,18,45,64,74,101,128],"intensify":[9],"the":[10,38,114,122,137],"search":[11],"and":[12,69,149,158],"identify":[13],"local":[14,67,78,89,131],"optima":[15,90],"with":[16,91],"respect":[17],"a":[19,26,103],"neighborhood":[20],"structure.":[21],"Even":[22],"if":[23],"they":[24],"constitute":[25],"central":[27],"component":[28],"of":[29,57,105,154],"modern":[30],"heuristics,":[31],"their":[32],"design":[33,143],"principally":[34],"consists":[35],"choosing":[37,121],"pivoting":[39,115],"rule,":[40],"which":[41,146],"is":[42],"reduced":[44],"two":[46],"alternative":[47],"strategies:":[48],"first":[49,148],"improvement":[50,139,151],"or":[51],"best":[52,150],"improvement.":[53],"The":[54,95],"conception":[55],"effort":[56],"most":[58],"belongs":[60],"proposing":[62],"techniques":[63],"escape":[65],"from":[66],"optima,":[68],"not":[70],"necessarily":[71],"on":[72,113],"how":[73],"climb":[75],"toward":[76],"better":[77,130],"optima.":[79,132],"In":[80],"this":[81,109],"paper,":[82],"we":[83,118],"interested":[85],"attaining":[87],"good":[88],"basic":[92],"hill-climbing":[93],"techniques.":[94],"NK":[96],"model":[97],"will":[98],"be":[99],"evaluate":[102],"set":[104],"climbers":[106,145],"proposed":[107],"paper.":[110],"By":[111],"focusing":[112],"rule":[116],"definition,":[117],"show":[119],"that":[120],"worst":[123,138],"improving":[124],"neighbor":[125],"leads":[127],"attain":[129],"Moreover,":[133],"by":[134],"slightly":[135],"modifying":[136],"strategy,":[140],"one":[141],"can":[142],"efficient":[144],"outperform":[147],"terms":[153],"tradeoff":[155],"between":[156],"quality":[157],"computational":[159],"effort.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}