{"id":"https://openalex.org/W2904153653","doi":"https://doi.org/10.1109/gcce.2018.8574497","title":"A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem","display_name":"A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2904153653","doi":"https://doi.org/10.1109/gcce.2018.8574497","mag":"2904153653"},"language":"en","primary_location":{"id":"doi:10.1109/gcce.2018.8574497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gcce.2018.8574497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 7th Global Conference on Consumer Electronics (GCCE)","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/A5102240651","display_name":"Takeshi Okano","orcid":null},"institutions":[{"id":"https://openalex.org/I136446963","display_name":"Okayama University of Science","ror":"https://ror.org/05aevyc10","country_code":"JP","type":"education","lineage":["https://openalex.org/I136446963"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeshi Okano","raw_affiliation_strings":["Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan","institution_ids":["https://openalex.org/I136446963"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111731834","display_name":"Kengo Katayama","orcid":null},"institutions":[{"id":"https://openalex.org/I136446963","display_name":"Okayama University of Science","ror":"https://ror.org/05aevyc10","country_code":"JP","type":"education","lineage":["https://openalex.org/I136446963"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kengo Katayama","raw_affiliation_strings":["Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan","institution_ids":["https://openalex.org/I136446963"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006753917","display_name":"Kazuho Kanahara","orcid":null},"institutions":[{"id":"https://openalex.org/I136446963","display_name":"Okayama University of Science","ror":"https://ror.org/05aevyc10","country_code":"JP","type":"education","lineage":["https://openalex.org/I136446963"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuho Kanahara","raw_affiliation_strings":["Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan","institution_ids":["https://openalex.org/I136446963"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052570826","display_name":"Noritaka Nishihara","orcid":null},"institutions":[{"id":"https://openalex.org/I136446963","display_name":"Okayama University of Science","ror":"https://ror.org/05aevyc10","country_code":"JP","type":"education","lineage":["https://openalex.org/I136446963"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Noritaka Nishihara","raw_affiliation_strings":["Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Engineering, Okayama University of Science, Okayama, Japan","institution_ids":["https://openalex.org/I136446963"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I136446963"],"apc_list":null,"apc_paid":null,"fwci":0.3395,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62676869,"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":"60","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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.9986000061035156,"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.9976000189781189,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.733251690864563},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6647445559501648},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.6636672019958496},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6026511192321777},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5564040541648865},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5502241253852844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5436586141586304},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5199395418167114},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.48895132541656494},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.485576331615448},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4562060534954071},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4491890072822571},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4190453588962555},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41077107191085815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3814573884010315},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.36786311864852905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3423200845718384},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.1684950888156891}],"concepts":[{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.733251690864563},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6647445559501648},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.6636672019958496},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6026511192321777},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5564040541648865},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5502241253852844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5436586141586304},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5199395418167114},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.48895132541656494},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.485576331615448},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4562060534954071},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4491890072822571},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4190453588962555},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41077107191085815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3814573884010315},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.36786311864852905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3423200845718384},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.1684950888156891},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/gcce.2018.8574497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gcce.2018.8574497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 7th Global Conference on Consumer Electronics (GCCE)","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":9,"referenced_works":["https://openalex.org/W1772988327","https://openalex.org/W1970372536","https://openalex.org/W2003870651","https://openalex.org/W2020696014","https://openalex.org/W2108455025","https://openalex.org/W2161455936","https://openalex.org/W2166452399","https://openalex.org/W3121235808","https://openalex.org/W6638086839"],"related_works":["https://openalex.org/W2476121495","https://openalex.org/W2382688260","https://openalex.org/W2370323645","https://openalex.org/W4237368524","https://openalex.org/W1543589757","https://openalex.org/W3003450854","https://openalex.org/W2084084982","https://openalex.org/W2025690249","https://openalex.org/W1843628981","https://openalex.org/W1492450056"],"abstract_inverted_index":{"The":[0],"quadratic":[1],"assignment":[2],"problem":[3],"(QAP)":[4],"has":[5],"practical":[6],"applications":[7],"in":[8],"the":[9,20,90,110],"electronics":[10],"domain,":[11],"such":[12,50],"as":[13,51,56],"component":[14],"placing":[15,28],"on":[16,24,31,86,107],"circuit":[17],"boards,":[18],"minimizing":[19],"number":[21],"of":[22,29,89,103],"transistors":[23],"integrated":[25],"circuits,":[26],"optimal":[27],"letters":[30],"touchscreen":[32],"devices,":[33],"etc.":[34],"Since":[35],"QAP":[36],"is":[37,101],"NP-hard":[38],"and":[39,113],"large":[40],"problems":[41],"are":[42,54],"not":[43],"practically":[44],"solvable":[45],"to":[46,60],"optimality,":[47],"heuristic":[48],"methods":[49],"local":[52,76,82,116],"search":[53,77,83,93,117],"regarded":[55],"an":[57],"efficient":[58],"algorithm":[59],"obtain":[61],"nearoptimal":[62],"solutions":[63,106],"within":[64],"a":[65,73,87],"reasonable":[66],"time.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"present":[72],"new":[74],"sophisticated":[75],"algorithm,":[78],"called":[79],"variant":[80,88],"k-opt":[81],"(vKLS),":[84],"based":[85],"variable":[91],"depth":[92],"for":[94],"QAP.":[95],"Computational":[96],"results":[97],"show":[98],"that":[99],"vKLS":[100],"capable":[102],"finding":[104],"better":[105],"average":[108],"than":[109],"standard":[111],"VDS":[112],"typical":[114],"2-opt":[115],"algorithms.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}