{"id":"https://openalex.org/W2725549081","doi":"https://doi.org/10.1145/3071178.3071291","title":"Heuristic rope team","display_name":"Heuristic rope team","publication_year":2017,"publication_date":"2017-06-30","ids":{"openalex":"https://openalex.org/W2725549081","doi":"https://doi.org/10.1145/3071178.3071291","mag":"2725549081"},"language":"en","primary_location":{"id":"doi:10.1145/3071178.3071291","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071291","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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","raw_type":"proceedings-article"},"type":"article","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/A5055546112","display_name":"Laurent Moalic","orcid":"https://orcid.org/0000-0003-3749-3227"},"institutions":[{"id":"https://openalex.org/I4210118524","display_name":"Universit\u00e9 Bourgogne Franche-Comt\u00e9","ror":"https://ror.org/02dn7x778","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210118524"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Laurent Moalic","raw_affiliation_strings":["Univ. Bourgogne Franche-Comt\u00e9, Belfort, France"],"affiliations":[{"raw_affiliation_string":"Univ. Bourgogne Franche-Comt\u00e9, Belfort, France","institution_ids":["https://openalex.org/I4210118524"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053144070","display_name":"Alexandre Gondran","orcid":"https://orcid.org/0000-0003-0116-021X"},"institutions":[{"id":"https://openalex.org/I100296615","display_name":"\u00c9cole Nationale de l\u2019Aviation Civile","ror":"https://ror.org/022zdgq74","country_code":"FR","type":"education","lineage":["https://openalex.org/I100296615","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alexandre Gondran","raw_affiliation_strings":["French Civil Aviation University, Toulouse, France"],"affiliations":[{"raw_affiliation_string":"French Civil Aviation University, Toulouse, France","institution_ids":["https://openalex.org/I100296615"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055546112"],"corresponding_institution_ids":["https://openalex.org/I4210118524"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06167401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"314","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9896000027656555,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9732000231742859,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rope","display_name":"Rope","score":0.8210546374320984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6161670088768005},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6097549796104431},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5491724610328674},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.516802191734314},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.469316691160202},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.4314807951450348},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4173109233379364},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.4114655554294586},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.38621461391448975},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35210758447647095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33897897601127625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27750474214553833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2756125330924988}],"concepts":[{"id":"https://openalex.org/C162269090","wikidata":"https://www.wikidata.org/wiki/Q1156047","display_name":"Rope","level":2,"score":0.8210546374320984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6161670088768005},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6097549796104431},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5491724610328674},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.516802191734314},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.469316691160202},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.4314807951450348},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4173109233379364},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.4114655554294586},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.38621461391448975},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35210758447647095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33897897601127625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27750474214553833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2756125330924988},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3071178.3071291","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071291","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01575818v1","is_oa":false,"landing_page_url":"https://enac.hal.science/hal-01575818","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":"GECCO '17, Genetic and Evolutionary Computation Conference , Jul 2017, Berlin, Germany. pp 314-320 / ISBN: 978-1-4503-4920-8 ⟨10.1145/3071178.3071291⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W28882840","https://openalex.org/W1582334898","https://openalex.org/W1597133315","https://openalex.org/W1971493157","https://openalex.org/W1985603248","https://openalex.org/W2003291739","https://openalex.org/W2013946649","https://openalex.org/W2016102370","https://openalex.org/W2021735068","https://openalex.org/W2021781365","https://openalex.org/W2035773351","https://openalex.org/W2047668495","https://openalex.org/W2053793706","https://openalex.org/W2055440347","https://openalex.org/W2066356146","https://openalex.org/W2100024690","https://openalex.org/W2104695995","https://openalex.org/W2128553546","https://openalex.org/W2141082967","https://openalex.org/W2153638045","https://openalex.org/W2156051492","https://openalex.org/W2166843422","https://openalex.org/W2167036627","https://openalex.org/W2168000780","https://openalex.org/W2239733629","https://openalex.org/W2324827308","https://openalex.org/W2401610261","https://openalex.org/W3022615405","https://openalex.org/W4285719527","https://openalex.org/W4302346334"],"related_works":["https://openalex.org/W2163647484","https://openalex.org/W47248985","https://openalex.org/W2000270779","https://openalex.org/W2129486222","https://openalex.org/W2107915862","https://openalex.org/W1990478250","https://openalex.org/W144563559","https://openalex.org/W2129420617","https://openalex.org/W3217012897","https://openalex.org/W1988808191"],"abstract_inverted_index":{"Optimization":[0],"problems":[1,49],"are":[2],"often":[3],"compared":[4,66],"to":[5,25,67,94,116,119,131,156],"mountain":[6],"climbing.":[7],"In":[8,20,77],"particular,":[9],"the":[10,28,40,71,82,99,134,139,158,165,170,174,186,189],"classical":[11],"Hill":[12],"Climber":[13],"is":[14,38,148,154],"a":[15,32,50,59,68,112,122],"so":[16],"used":[17],"local":[18,60,123],"search.":[19],"this":[21,78,146,193],"paper":[22,79],"we":[23,80,195],"propose":[24,81],"explore":[26],"further":[27],"analogy":[29],"with":[30,87,103,203,207,212],"climbing":[31],"mountain,":[33],"not":[34,74],"alone":[35],"as":[36],"it":[37,153],"generally":[39],"case":[41],"but":[42],"in":[43,114],"rope":[44,100],"team.":[45],"Indeed,":[46],"for":[47,162],"difficult":[48,166],"single":[51],"climber":[52],"(heuristic)":[53],"can":[54,64,73,179,196],"easily":[55],"be":[56,65,180],"trapped":[57],"into":[58],"optimum.":[61,124],"This":[62,125],"situation":[63],"crevasse":[69],"which":[70,92],"heuristic":[72,85],"escape":[75,120],"from.":[76],"Rope":[83],"Team":[84],"dealing":[86],"several":[88],"elementary":[89],"memetic":[90],"heuristics":[91],"corresponds":[93],"climbers.":[95],"The":[96,143],"leader":[97],"of":[98,133,145,164,185,192],"team":[101],"bring":[102],"him":[104,118],"at":[105],"least":[106],"one":[107,132,151],"other":[108,175],"climber,":[109],"linked":[110],"by":[111],"rope,":[113],"order":[115],"help":[117],"from":[121,169],"approach":[126,147],"has":[127],"been":[128],"successfully":[129],"applied":[130],"most":[135,163],"studied":[136],"combinatorial":[137],"problem:":[138],"Graph":[140],"Coloring":[141],"Problem.":[142],"advantage":[144],"twofold:":[149],"on":[150,173],"hand,":[152,176],"able":[155],"find":[157],"best":[159],"known":[160],"solution":[161],"graphs":[167],"coming":[168],"DIMACS":[171],"benchmark;":[172],"all":[177],"climbers":[178],"considered":[181],"simultaneously,":[182],"allowing":[183],"parallelization":[184],"algorithm.":[187],"Among":[188],"significant":[190],"results":[191],"work":[194],"notice":[197],"3":[198],"well-studied":[199],"graphs,":[200],"DSJC500.5":[201],"colored":[202],"47":[204],"colors,":[205],"DSJC1000.5":[206],"82":[208],"colors":[209],"and":[210],"flat1000_76_0":[211],"81":[213],"colors.":[214]},"counts_by_year":[],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2017-07-14T00:00:00"}