{"id":"https://openalex.org/W1982729314","doi":"https://doi.org/10.4018/jsir.2011040104","title":"Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem","display_name":"Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W1982729314","doi":"https://doi.org/10.4018/jsir.2011040104","mag":"1982729314"},"language":"en","primary_location":{"id":"doi:10.4018/jsir.2011040104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jsir.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","raw_type":"journal-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/A5023755737","display_name":"Tabitha James","orcid":"https://orcid.org/0000-0002-0143-958X"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tabitha James","raw_affiliation_strings":["Virginia Tech, USA","Virginia Tech, USA,"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, USA,","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051866947","display_name":"C\u00e9sar Rego","orcid":"https://orcid.org/0000-0002-1713-2494"},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesar Rego","raw_affiliation_strings":["University of Mississippi, USA","(University of Mississippi, USA)"],"affiliations":[{"raw_affiliation_string":"University of Mississippi, USA","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"(University of Mississippi, USA)","institution_ids":["https://openalex.org/I368840534"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023755737"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13280974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"2","first_page":"52","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9988999962806702,"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.9979000091552734,"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/tabu-search","display_name":"Tabu search","score":0.927563488483429},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6829246282577515},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6785283088684082},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.6466656923294067},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5622677803039551},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5490971207618713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.468584269285202},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4327213168144226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41802462935447693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4176861643791199},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.3907734751701355}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.927563488483429},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6829246282577515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6785283088684082},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.6466656923294067},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5622677803039551},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5490971207618713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.468584269285202},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4327213168144226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41802462935447693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4176861643791199},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3907734751701355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jsir.2011040104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jsir.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jsir00:v:2:y:2011:i:2:p:52-70","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsir.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W19016451","https://openalex.org/W1503085769","https://openalex.org/W1563291122","https://openalex.org/W1580654495","https://openalex.org/W1666350026","https://openalex.org/W1966213445","https://openalex.org/W1971700807","https://openalex.org/W1975389169","https://openalex.org/W1989938457","https://openalex.org/W2011375626","https://openalex.org/W2017377855","https://openalex.org/W2051391874","https://openalex.org/W2074502683","https://openalex.org/W2093475907","https://openalex.org/W2095703590","https://openalex.org/W2098677716","https://openalex.org/W2107709238","https://openalex.org/W2121035504","https://openalex.org/W2123478933","https://openalex.org/W2124841523","https://openalex.org/W2135255362","https://openalex.org/W2152825263","https://openalex.org/W2170712730","https://openalex.org/W2216948015","https://openalex.org/W2403173049","https://openalex.org/W4230109265"],"related_works":["https://openalex.org/W2794855054","https://openalex.org/W2081475278","https://openalex.org/W2167308444","https://openalex.org/W2137181043","https://openalex.org/W206409801","https://openalex.org/W2128289553","https://openalex.org/W1975389169","https://openalex.org/W150166259","https://openalex.org/W2103589583","https://openalex.org/W2126997300"],"abstract_inverted_index":{"This":[0,114],"paper":[1],"introduces":[2],"a":[3,46,51,117],"new":[4],"path":[5,43,131],"relinking":[6,44,132],"algorithm":[7,37,55,62,78],"for":[8,119,127,137],"the":[9,83,104,107],"well-known":[10],"quadratic":[11],"assignment":[12],"problem":[13],"(QAP)":[14],"in":[15,24,39,146],"combinatorial":[16],"optimization.":[17,149],"The":[18,36,60,87],"QAP":[19,85,124],"has":[20,63],"attracted":[21],"considerable":[22],"attention":[23],"research":[25],"because":[26],"of":[27,106,139],"its":[28,31],"complexity":[29],"and":[30,66,133,136],"applicability":[32],"to":[33,109],"many":[34],"domains.":[35],"presented":[38],"this":[40,77],"study":[41],"employs":[42],"as":[45,56],"solution":[47],"combination":[48],"method":[49],"incorporating":[50],"multistart":[52],"tabu":[53,134],"search":[54],"an":[57,91],"improvement":[58],"method.":[59],"resulting":[61],"interesting":[64],"similarities":[65],"contrasts":[67],"with":[68,142],"particle":[69,147],"swarm":[70,148],"optimization":[71],"methods.":[72],"Computational":[73],"testing":[74],"indicates":[75],"that":[76,81],"produces":[79],"results":[80],"rival":[82],"best":[84],"algorithms.":[86],"authors":[88],"additionally":[89],"conduct":[90],"analysis":[92,115],"disclosing":[93],"how":[94],"different":[95],"strategies":[96],"prove":[97],"more":[98,121],"or":[99],"less":[100],"effective":[101,122],"depending":[102],"on":[103,130],"landscapes":[105],"problems":[108],"which":[110],"they":[111],"are":[112],"applied.":[113],"lays":[116],"foundation":[118],"developing":[120],"future":[123],"algorithms,":[125],"both":[126],"methods":[128,141],"based":[129],"search,":[135],"hybrids":[138],"such":[140],"related":[143],"processes":[144],"found":[145]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}