{"id":"https://openalex.org/W2143705171","doi":"https://doi.org/10.1109/cec.2008.4630807","title":"Improving the Ant Colony Optimization Algorithm for the Quadratic Assignment Problem","display_name":"Improving the Ant Colony Optimization Algorithm for the Quadratic Assignment Problem","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2143705171","doi":"https://doi.org/10.1109/cec.2008.4630807","mag":"2143705171"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4630807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/A5058768233","display_name":"Malek Mouhoub","orcid":"https://orcid.org/0000-0001-7381-1064"},"institutions":[{"id":"https://openalex.org/I194028371","display_name":"University of Regina","ror":"https://ror.org/03dzc0485","country_code":"CA","type":"education","lineage":["https://openalex.org/I194028371"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Malek Mouhoub","raw_affiliation_strings":["University of Regina, Regina, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Regina, Regina, Canada","institution_ids":["https://openalex.org/I194028371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100419338","display_name":"Zhijie Wang","orcid":"https://orcid.org/0000-0003-4559-5426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhijie Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.51,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89929171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994999766349792,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994999766349792,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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.8403722047805786},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.642305850982666},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5993152260780334},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5858026742935181},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5238297581672668},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5066822171211243},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.48757117986679077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47848647832870483},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.47844603657722473},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47574353218078613},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.462035208940506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34769436717033386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3326149880886078},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0834590494632721}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8403722047805786},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.642305850982666},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5993152260780334},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5858026742935181},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5238297581672668},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5066822171211243},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.48757117986679077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47848647832870483},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.47844603657722473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47574353218078613},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.462035208940506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34769436717033386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3326149880886078},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0834590494632721},{"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/cec.2008.4630807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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":12,"referenced_works":["https://openalex.org/W168006464","https://openalex.org/W1480521908","https://openalex.org/W1503085769","https://openalex.org/W1580654495","https://openalex.org/W1933569933","https://openalex.org/W1989353689","https://openalex.org/W2009832821","https://openalex.org/W2140481494","https://openalex.org/W2188073019","https://openalex.org/W4239007981","https://openalex.org/W6606839663","https://openalex.org/W6687099399"],"related_works":["https://openalex.org/W3036220094","https://openalex.org/W2167308444","https://openalex.org/W2137181043","https://openalex.org/W2103589583","https://openalex.org/W1975389169","https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W2519041592","https://openalex.org/W2126997300","https://openalex.org/W2156087782"],"abstract_inverted_index":{"The":[0,201],"quadratic":[1],"assignment":[2],"problem":[3,34],"(QAP)":[4],"is":[5,125,139,160],"a":[6,120,129,136,156],"well":[7],"known":[8],"important":[9],"combinatorial":[10],"problem.":[11],"Indeed,":[12],"many":[13],"real":[14],"world":[15],"applications":[16],"such":[17],"as":[18,29],"backboard":[19],"wiring,":[20],"typewriter":[21],"keyboard":[22],"design":[23],"and":[24,48,72,86,109,191,197],"scheduling":[25],"can":[26],"be":[27],"formulated":[28],"QAPs.":[30],"Recently,":[31],"tackling":[32],"this":[33,93],"has":[35],"been":[36],"addressed":[37],"by":[38],"ant":[39,52],"colony":[40],"optimization":[41],"(ACO)":[42],"Algorithms.":[43],"To":[44],"do":[45],"so,":[46],"ACOs,":[47],"more":[49,145],"precisely":[50],"min-max":[51],"system":[53],"(MMAS)":[54],"Algorithms,":[55],"are":[56],"usually":[57],"combined":[58],"with":[59,196],"two":[60,101],"kinds":[61],"of":[62,99,107,114,150,176,214,217,239],"stochastic":[63],"local":[64,70,75,133,168,207],"search":[65,71],"(SLS)":[66],"methods:":[67],"the":[68,73,105,112,143,148,174,199,205,215,218,222,230],"2-opt":[69],"tabu":[74],"search.":[76],"We":[77],"talk":[78],"then":[79],"respectively":[80,186],"about":[81],"MMAS":[82,87,115,151,187,192],"<sub":[83,88,116,152,188,193],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[84,89,117,153,189,194],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2opt</sub>":[85,118,190],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">tabu</sub>":[90,154,195],".":[91],"In":[92,111,147,170],"paper,":[94],"we":[95,180,226],"propose":[96],"an":[97],"improvement":[98],"these":[100],"methods":[102,232],"according":[103],"to":[104,127,141,163,172],"properties":[106],"ACO":[108],"QAP.":[110],"case":[113,149],",":[119,155],"new":[121],"random":[122,157],"walk":[123,158],"strategy":[124,138,159],"used":[126],"avoid":[128,164],"quick":[130],"stagnation":[131],"into":[132],"optima.":[134,169],"Moreover,":[135,225],"forward-looking":[137],"proposed":[140,178],"explore":[142],"neighborhood":[144],"thoroughly.":[146],"also":[161,227],"employed":[162],"getting":[165],"stuck":[166],"at":[167],"order":[171],"show":[173],"merits":[175],"our":[177],"techniques":[179],"have":[181,209],"conducted":[182],"experimental":[183],"tests":[184],"comparing":[185],"without":[198],"improvements.":[200],"results":[202],"demonstrate":[203],"that":[204,229],"improved":[206,231],"method,":[208],"better":[210],"performance":[211],"in":[212],"terms":[213],"quality":[216],"solution":[219],"returned":[220],"than":[221],"original":[223],"ones.":[224],"noticed":[228],"outperform":[233],"each":[234],"other":[235],"for":[236],"different":[237],"classes":[238],"problems.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}