{"id":"https://openalex.org/W2165739754","doi":"https://doi.org/10.1109/cec.2013.6557815","title":"Instance generator for the quadratic assignment problem with additively decomposable cost function","display_name":"Instance generator for the quadratic assignment problem with additively decomposable cost function","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2165739754","doi":"https://doi.org/10.1109/cec.2013.6557815","mag":"2165739754"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on 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/A5016131956","display_name":"M\u0103d\u0103lina M. Drugan","orcid":"https://orcid.org/0000-0001-9497-3134"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]},{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]}],"countries":["BE","NL"],"is_corresponding":true,"raw_author_name":"Madalina M. Drugan","raw_affiliation_strings":["Artificial Intelligence Lab, Vrije Universiteit Brussel, Brussels, Belgium","Department of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Artificial Intelligence Lab, Vrije Universiteit Brussel, Brussels, Belgium","institution_ids":["https://openalex.org/I13469542"]},{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016131956"],"corresponding_institution_ids":["https://openalex.org/I13469542","https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.3962,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85412097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":null,"first_page":"2086","last_page":"2093"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.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/T12176","display_name":"Optimization and Packing Problems","score":0.9962999820709229,"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/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.7325826287269592},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.718201756477356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6795687675476074},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6187946200370789},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5661258101463318},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5599800944328308},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5593518614768982},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5578502416610718},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5214006900787354},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4950360357761383},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4612196385860443},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4264048635959625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4187157154083252},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33175837993621826},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.09197980165481567}],"concepts":[{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.7325826287269592},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.718201756477356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6795687675476074},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6187946200370789},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5661258101463318},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5599800944328308},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5593518614768982},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5578502416610718},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5214006900787354},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4950360357761383},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4612196385860443},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4264048635959625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4187157154083252},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33175837993621826},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.09197980165481567},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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":5,"locations":[{"id":"doi:10.1109/cec.2013.6557815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:library.tue.nl:839870","is_oa":false,"landing_page_url":"http://repository.tue.nl/839870","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:889216","is_oa":false,"landing_page_url":"http://repository.tue.nl/889216","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:240557","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"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"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:86079","is_oa":false,"landing_page_url":"https://biblio.vub.ac.be/vubir/instance-generator-for-the-quadratic-assignment-problem-with-additively-decomposable-cost-function(76de1a7f-27aa-49c3-befd-ca4179d154a4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1495804950","https://openalex.org/W1539664248","https://openalex.org/W1541678917","https://openalex.org/W1874649147","https://openalex.org/W2013603106","https://openalex.org/W2015206516","https://openalex.org/W2020696014","https://openalex.org/W2029356778","https://openalex.org/W2061494390","https://openalex.org/W2098677716","https://openalex.org/W2107709238","https://openalex.org/W2121035504","https://openalex.org/W3121748795","https://openalex.org/W4230109265","https://openalex.org/W6639261569"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W1666350026","https://openalex.org/W1996453501","https://openalex.org/W4394238759","https://openalex.org/W2051877214","https://openalex.org/W2346455737","https://openalex.org/W4385205110","https://openalex.org/W1998981559"],"abstract_inverted_index":{"-Quadratic":[0],"assignment":[1],"problems":[2,8],"(QAPs)":[3],"are":[4],"NP-hard":[5],"combinatorial":[6],"optimization":[7],"often":[9],"used":[10,31],"to":[11,50,79],"compare":[12],"the":[13,84,87,99,113,117,130,133,149,156],"performance":[14],"of":[15,102,132,151],"meta-heuristics.":[16,35],"In":[17],"this":[18,152],"paper,":[19],"we":[20],"propose":[21],"a":[22,43,61],"QAP":[23,40,46,62,89,110],"problem":[24],"instance":[25,47,63],"generator":[26,37],"whose":[27],"instances":[28,41,90,111],"can":[29,141],"be":[30],"as":[32,121],"benchmark":[33],"for":[34,67,98],"Our":[36],"aggregates":[38],"various":[39],"into":[42],"larger":[44],"size":[45],"in":[48],"order":[49],"obtain":[51],"an":[52],"large":[53],"size,":[54],"additively":[55],"decomposable":[56],"QAP.":[57],"We":[58,82,92,123],"assume":[59],"that":[60,64,125,128,145],"is":[65],"difficult":[66],"local":[68,72,76,139,158],"search":[69,77,135,153],"has":[70],"many":[71],"optima":[73],"from":[74,116],"which":[75],"needs":[78],"escape":[80],"from.":[81],"call":[83],"resulting":[85],"QAPs":[86,115],"composite":[88,104],"(cQAPs).":[91],"use":[93],"numerical":[94],"and":[95],"empirical":[96],"techniques":[97],"landscape":[100],"analysis":[101],"generated":[103],"QAPs.":[105],"The":[106],"comparison":[107],"between":[108],"our":[109],"with":[112],"other":[114,143],"literature":[118],"classify":[119],"cQAPs":[120],"difficult.":[122],"show":[124],"heuristic":[126],"algorithms":[127],"exploit":[129],"particularities":[131],"cQAP":[134],"space,":[136,154],"like":[137,155],"iterated":[138],"search,":[140],"outperform":[142],"heuristics":[144],"do":[146],"not":[147],"consider":[148],"structure":[150],"multi-restart":[157],"search.":[159]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}