{"id":"https://openalex.org/W7097216623","doi":null,"title":"Fitness Landscapes of Combinatorial Problems And The Performance Of Search Algorithms","display_name":"Fitness Landscapes of Combinatorial Problems And The Performance Of Search Algorithms","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097216623"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.2745","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.2745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.grappa.univ-lille3.fr/~ppreux/papiers/lil-97-13.ps.gz","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097216623"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5049600908","display_name":"Philippe Preux","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe Preux","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045208034","display_name":"Denis Robilliard","orcid":"https://orcid.org/0000-0003-1836-6679","observed_orcids":["https://orcid.org/0000-0003-1836-6679"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis Robilliard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003818390","display_name":"Cyril Fonlupt","orcid":"https://orcid.org/0000-0003-4729-4715","observed_orcids":["https://orcid.org/0000-0003-4729-4715"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cyril Fonlupt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"R. M. Karp","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. M. Karp","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"J. M. Steele","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. M. Steele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9932000041007996,"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":0.9932000041007996,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.000699999975040555,"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/fitness-landscape","display_name":"fitness landscape","score":0.9909999966621399},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8460000157356262},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9700000286102295},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.8059999942779541},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"hill climbing","score":0.765999972820282},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6230000257492065}],"concepts":[{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.7254999876022339},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6729999780654907},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6589999794960022},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5961999893188477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5414000153541565},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46480000019073486},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4074999988079071},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39570000767707825},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.38040000200271606},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3734000027179718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.349700003862381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34950000047683716},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.3458000123500824},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3027999997138977},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29339998960494995},{"id":"https://openalex.org/C148392497","wikidata":"https://www.wikidata.org/wiki/Q16250539","display_name":"Fitness approximation","level":4,"score":0.27790001034736633},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.2632000148296356},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.2574000060558319},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.2745","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.2745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.grappa.univ-lille3.fr/~ppreux/papiers/lil-97-13.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7099159978","https://openalex.org/W2810048815","https://openalex.org/W1493992103","https://openalex.org/W4236160677","https://openalex.org/W2618079578","https://openalex.org/W2728811798","https://openalex.org/W7098484086","https://openalex.org/W1542211788","https://openalex.org/W4390851485","https://openalex.org/W2184455376"],"abstract_inverted_index":{"This":[0],"work":[1],"settles":[2],"in":[3,99],"the":[4,7,19,49,69,77,80,83,139,142],"framework":[5],"of":[6,21,52,76,87,125],"fitness":[8,22],"landscape":[9],"paradigm":[10],"and":[11,24,26,56],"its":[12],"application":[13],"to":[14,44,68,118],"combinatorial":[15],"problems.":[16],"We":[17],"study":[18],"interdependance":[20],"landscapes":[23,31],"heuristics,":[25],"figure":[27],"out":[28],"some":[29,46],"TSP":[30,53,81,116],"statistical":[32],"characteristics":[33],"associated":[34],"with":[35],"local":[36,61,130],"search":[37,54,62],"operators.":[38],"Then":[39],"we":[40],"use":[41],"this":[42,104],"knowledge":[43],"shed":[45],"light":[47],"on":[48,115],"general":[50],"behavior":[51],"algorithms,":[55,148,152],"derive":[57],"a":[58,111,121,127,134],"simple":[59,88,112],"population-based":[60],"heuristic":[63,89],"that":[64],"performs":[65],"favorably":[66],"compared":[67],"well-known":[70],"ILK":[71],"technique.":[72],"1":[73],"Introduction":[74],"One":[75],"mysteries":[78],"surrounding":[79],"is":[82,107],"remarkably":[84],"effective":[85],"performance":[86],"solution":[90],"methods.":[91],"R.":[92],"M.":[93,97],"Karp":[94],"&":[95],"J.":[96],"Steele,":[98],"[LLKS85]":[100],"As":[101],"stressed":[102],"by":[103],"quote,":[105],"one":[106],"surprised":[108],"when":[109],"running":[110],"hill-climbing":[113],"algorithm":[114],"instances":[117],"find,":[119],"after":[120],"very":[122],"short":[123],"amount":[124],"time,":[126,144],"rather":[128],"good":[129,135],"optimum":[131],"(if":[132],"using":[133],"operator,":[136],"such":[137,149],"as":[138,150],"2-change).":[140],"In":[141],"same":[143],"more":[145],"complex":[146],"descent":[147],"genetic":[151],"...":[153]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097216623","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
