{"id":"https://openalex.org/W1988734920","doi":"https://doi.org/10.1109/tcyb.2013.2256892","title":"Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem","display_name":"Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem","publication_year":2013,"publication_date":"2013-05-17","ids":{"openalex":"https://openalex.org/W1988734920","doi":"https://doi.org/10.1109/tcyb.2013.2256892","mag":"1988734920","pmid":"https://pubmed.ncbi.nlm.nih.gov/23757559"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2013.2256892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2013.2256892","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://rke.abertay.ac.uk/ws/files/8550326/Sun_Meta-HeuristicCombiningPrior_Author_2014.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049272511","display_name":"Jianyong Sun","orcid":"https://orcid.org/0000-0002-8177-1354"},"institutions":[{"id":"https://openalex.org/I877506347","display_name":"Abertay University","ror":"https://ror.org/04mwwnx67","country_code":"GB","type":"education","lineage":["https://openalex.org/I877506347"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jianyong Sun","raw_affiliation_strings":["School of Engineering, Computing and Applied Mathematics, The University of Abertay Dundee, Dundee, Scotland, United Kingdom","Sch. of Eng., Comput. & Appl. Math., Univ. of Abertay Dundee, Dundee, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, Computing and Applied Mathematics, The University of Abertay Dundee, Dundee, Scotland, United Kingdom","institution_ids":["https://openalex.org/I877506347"]},{"raw_affiliation_string":"Sch. of Eng., Comput. & Appl. Math., Univ. of Abertay Dundee, Dundee, UK","institution_ids":["https://openalex.org/I877506347"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000546219","display_name":"Qingfu Zhang","orcid":"https://orcid.org/0000-0003-0786-0671"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Qingfu Zhang","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong","Dept. of Computer Science, City University of Hong Kong, Kowloon, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Dept. of Computer Science, City University of Hong Kong, Kowloon, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["CERCIA, The University of Birmingham, Birmingham, West Midlands, United Kingdom","School of Computer Science, University of Birmingham, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CERCIA, The University of Birmingham, Birmingham, West Midlands, United Kingdom","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":7.4108,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.96285815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"3","first_page":"429","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.8398810625076294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7349609732627869},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.7215272784233093},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6348865032196045},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5833936333656311},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.543482780456543},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5425664782524109},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4591917097568512},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42878082394599915},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3958790898323059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3416762351989746},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32013511657714844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2964899241924286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1675715446472168}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8398810625076294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7349609732627869},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.7215272784233093},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6348865032196045},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5833936333656311},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.543482780456543},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5425664782524109},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4591917097568512},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42878082394599915},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3958790898323059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3416762351989746},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32013511657714844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2964899241924286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1675715446472168},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tcyb.2013.2256892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2013.2256892","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},{"id":"pmid:23757559","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/23757559","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on cybernetics","raw_type":"Journal Article"},{"id":"pmh:oai:rke.abertay.ac.uk:openaire/bf1bb70a-95a5-447a-81fc-eb5c74206aaf","is_oa":true,"landing_page_url":"https://rke.abertay.ac.uk/en/publications/bf1bb70a-95a5-447a-81fc-eb5c74206aaf","pdf_url":"https://rke.abertay.ac.uk/ws/files/8550326/Sun_Meta-HeuristicCombiningPrior_Author_2014.pdf","source":{"id":"https://openalex.org/S4306402526","display_name":"Abertay Research Portal (Abertay University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I877506347","host_organization_name":"Abertay University","host_organization_lineage":["https://openalex.org/I877506347"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun, J, Zhang, Q & Yao, X 2014, 'Meta-heuristic combining prior online and offline information for the quadratic assignment problem', IEEE Transactions on Cybernetics, vol. 44, no. 3, pp. 429 - 444. https://doi.org/10.1109/TCYB.2013.2256892","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/50f1a277-31e3-405b-9dd5-aecafe96aea5","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/50f1a277-31e3-405b-9dd5-aecafe96aea5","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun, J, Zhang, Q & Yao, X 2014, 'Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem', IEEE Transactions on Cybernetics, vol. 44, no. 3, pp. 429-444. https://doi.org/10.1109/TCYB.2013.2256892","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:rke.abertay.ac.uk:openaire/bf1bb70a-95a5-447a-81fc-eb5c74206aaf","is_oa":true,"landing_page_url":"https://rke.abertay.ac.uk/en/publications/bf1bb70a-95a5-447a-81fc-eb5c74206aaf","pdf_url":"https://rke.abertay.ac.uk/ws/files/8550326/Sun_Meta-HeuristicCombiningPrior_Author_2014.pdf","source":{"id":"https://openalex.org/S4306402526","display_name":"Abertay Research Portal (Abertay University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I877506347","host_organization_name":"Abertay University","host_organization_lineage":["https://openalex.org/I877506347"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun, J, Zhang, Q & Yao, X 2014, 'Meta-heuristic combining prior online and offline information for the quadratic assignment problem', IEEE Transactions on Cybernetics, vol. 44, no. 3, pp. 429 - 444. https://doi.org/10.1109/TCYB.2013.2256892","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2841756755","display_name":"Evolutionary Approximation Algorithms for Optimisation: Algorithm Design and Complexity Analysis","funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5904918521","display_name":null,"funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7201549544","display_name":null,"funder_award_id":"61273313","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1988734920.pdf","grobid_xml":"https://content.openalex.org/works/W1988734920.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W19016451","https://openalex.org/W19646579","https://openalex.org/W158757845","https://openalex.org/W165672800","https://openalex.org/W1492433263","https://openalex.org/W1508543123","https://openalex.org/W1508767046","https://openalex.org/W1536573229","https://openalex.org/W1563291122","https://openalex.org/W1577352482","https://openalex.org/W1582417773","https://openalex.org/W1667957304","https://openalex.org/W1801849579","https://openalex.org/W1930648503","https://openalex.org/W1963831867","https://openalex.org/W1971204143","https://openalex.org/W1971309542","https://openalex.org/W1971700807","https://openalex.org/W1972093914","https://openalex.org/W1974164873","https://openalex.org/W1977846845","https://openalex.org/W1985109028","https://openalex.org/W1989938457","https://openalex.org/W2001386238","https://openalex.org/W2009129472","https://openalex.org/W2009832821","https://openalex.org/W2020696014","https://openalex.org/W2039712181","https://openalex.org/W2048698391","https://openalex.org/W2053559291","https://openalex.org/W2063193808","https://openalex.org/W2066670127","https://openalex.org/W2075342830","https://openalex.org/W2093083775","https://openalex.org/W2099861483","https://openalex.org/W2100274914","https://openalex.org/W2103315280","https://openalex.org/W2107709238","https://openalex.org/W2107897921","https://openalex.org/W2107941094","https://openalex.org/W2117522162","https://openalex.org/W2117942072","https://openalex.org/W2139015486","https://openalex.org/W2140481494","https://openalex.org/W2144952620","https://openalex.org/W2152195021","https://openalex.org/W2152825263","https://openalex.org/W2166210809","https://openalex.org/W2170712730","https://openalex.org/W2309459014","https://openalex.org/W2414365832","https://openalex.org/W2529998893","https://openalex.org/W2911221835","https://openalex.org/W4236605548","https://openalex.org/W4292408555","https://openalex.org/W6606822168","https://openalex.org/W6652740703","https://openalex.org/W6667105127"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"The":[0,123],"construction":[1,43],"of":[2,19,112,130,159,170,174,195],"promising":[3,78],"solutions":[4,31],"for":[5,120,134],"NP-hard":[6],"combinatorial":[7],"optimization":[8],"problems":[9],"(COPs)":[10],"in":[11,40,198],"meta-heuristics":[12,74],"is":[13,65],"usually":[14],"based":[15],"on":[16,116],"three":[17,172],"types":[18,158,173],"information,":[20,24,149],"namely":[21],"a":[22,25,128,152],"priori":[23],"posteriori":[26],"information":[27,38,46,70,91,115,160,175],"learned":[28],"from":[29,181],"visited":[30],"during":[32],"the":[33,41,52,60,73,88,102,110,121,135,168,171,182,193,199],"search":[34,61,79,103],"procedure,":[35],"and":[36,96],"online":[37,90,147],"collected":[39],"solution":[42],"process.":[44],"Prior":[45],"reflects":[47],"our":[48],"domain":[49,55],"knowledge":[50,56],"about":[51],"COPs.":[53,122],"Extensive":[54],"can":[57,92,99,161,186],"surely":[58],"make":[59],"effective,":[62],"yet":[63],"it":[64,82],"not":[66],"always":[67],"available.":[68],"Posterior":[69],"could":[71],"guide":[72,192],"to":[75,145,176,191],"globally":[76],"explore":[77],"areas,":[80],"but":[81],"lacks":[83],"local":[84,94,148],"guidance":[85],"capability.":[86],"On":[87],"contrary,":[89],"capture":[93],"structures,":[95],"its":[97],"application":[98],"help":[100],"exploit":[101],"space.":[104],"In":[105],"this":[106,114],"paper,":[107],"we":[108,166],"studied":[109,167],"effects":[111],"using":[113],"metaheuristic's":[117],"algorithmic":[118],"performances":[119],"study":[124],"was":[125],"illustrated":[126],"by":[127],"set":[129],"heuristic":[131],"algorithms":[132],"developed":[133,151],"quadratic":[136],"assignment":[137],"problem.":[138],"We":[139],"first":[140],"proposed":[141],"an":[142],"improved":[143],"scheme":[144],"extract":[146],"then":[150],"unified":[153],"framework":[154],"under":[155],"which":[156,185],"all":[157],"be":[162,187],"combined":[163],"readily.":[164],"Finally,":[165],"benefits":[169],"meta-heuristics.":[177],"Conclusions":[178],"were":[179],"drawn":[180],"comprehensive":[183],"study,":[184],"used":[188],"as":[189],"principles":[190],"design":[194],"effective":[196],"meta-heuristic":[197],"future.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}