{"id":"https://openalex.org/W2038043611","doi":"https://doi.org/10.1145/2576768.2598296","title":"Search for maximal snake-in-the-box using new genetic algorithm","display_name":"Search for maximal snake-in-the-box using new genetic algorithm","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W2038043611","doi":"https://doi.org/10.1145/2576768.2598296","mag":"2038043611"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598296","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598296","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":"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/A5051414287","display_name":"Kim-Hang Ruiz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kim-Hang Ruiz","raw_affiliation_strings":["International MIS, Evans, GA, USA"],"affiliations":[{"raw_affiliation_string":"International MIS, Evans, GA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051414287"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08224599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"831","last_page":"838"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996399998664856,"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.996399998664856,"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.9890999794006348,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9828000068664551,"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/algorithm","display_name":"Algorithm","score":0.6363606452941895},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.560985803604126},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5226613879203796},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.5105582475662231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5044392347335815},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4959300458431244},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.42387089133262634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34340643882751465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28211894631385803},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.0957549512386322}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6363606452941895},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.560985803604126},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5226613879203796},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.5105582475662231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5044392347335815},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4959300458431244},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.42387089133262634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34340643882751465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28211894631385803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0957549512386322}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2576768.2598296","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598296","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2029853934","https://openalex.org/W2041066256","https://openalex.org/W2048232458","https://openalex.org/W2054701127","https://openalex.org/W2097707821","https://openalex.org/W2124607527","https://openalex.org/W2130713341","https://openalex.org/W2156683452","https://openalex.org/W2159193852","https://openalex.org/W2163405210","https://openalex.org/W2168897714","https://openalex.org/W2182768103","https://openalex.org/W2200502780","https://openalex.org/W3127549917","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2582091787","https://openalex.org/W2998661990","https://openalex.org/W4213195198","https://openalex.org/W843542728","https://openalex.org/W2354443135","https://openalex.org/W2811435312","https://openalex.org/W3181093338","https://openalex.org/W2382626982","https://openalex.org/W4200565068","https://openalex.org/W1576773757"],"abstract_inverted_index":{"The":[0,121],"\"Snake-In-The-Box\"":[1],"(SIB)":[2],"problem":[3,9],"is":[4,158],"a":[5,71,90],"challenging":[6],"combinatorial":[7],"search":[8,29,80,92,102],"to":[10,25,53,62,111,119,143,166,174],"find":[11],"the":[12,65,75,79,85,104,135,147,178],"longest":[13],"constrained":[14],"open":[15],"path":[16],"(k-spread":[17],"snake)":[18],"in":[19,101,113,129,177],"n-dimensional":[20],"hypercube":[21,86],"(Qn).":[22],"In":[23],"addition":[24],"constructive":[26],"techniques,":[27],"many":[28],"algorithms":[30],"such":[31],"as":[32,74],"Depth":[33],"First":[34],"Search":[35,48],"(DFS),":[36],"Genetic":[37,95],"Algorithm":[38,96],"(GA),":[39],"hybrid":[40],"Evolutionary":[41],"Computation":[42],"algorithm":[43],"(EC),":[44],"and":[45,61,132,146],"Nested":[46],"Monte-Carlo":[47],"(NMCS)":[49],"have":[50],"been":[51],"used":[52,70],"tackle":[54],"this":[55],"problem.":[56],"To":[57],"get":[58],"better":[59],"results":[60],"speed":[63],"up":[64],"process,":[66],"these":[67],"techniques":[68],"often":[69],"long":[72],"snake":[73,153],"starting":[76],"point":[77],"for":[78,103],"(priming/seeding).":[81],"This":[82],"paper":[83],"reviews":[84],"fundamentals,":[87],"then":[88],"presents":[89],"new":[91,125],"technique,":[93],"Mitosis":[94],"(MGA),":[97],"which":[98],"was":[99],"applied":[100],"four":[105],"different":[106,115],"spread":[107,141,144],"snakes":[108,128,139],"(spread":[109],"2":[110,142],"5)":[112],"seven":[114],"dimensional":[116],"hypercubes":[117],"(Q6":[118],"Q13).":[120],"MGA":[122],"found":[123,162],"three":[124],"record-breaking":[126],"3-spread":[127],"Q10,":[130],"Q11":[131],"Q13,":[133],"all":[134],"previously":[136],"known":[137,150],"optimal":[138],"from":[140],"5,":[145],"best":[148],"previous":[149],"maximal":[151],"3-S9":[152],"of":[154],"length":[155],"63.":[156],"It":[157],"remarkable":[159],"that":[160],"it":[161],"those":[163],"within":[164],"minutes":[165],"hours":[167],"without":[168],"priming,":[169],"significantly":[170],"shorter":[171],"than":[172],"days":[173],"weeks":[175],"needed":[176],"other":[179],"techniques.":[180]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}