{"id":"https://openalex.org/W2794497090","doi":"https://doi.org/10.13053/cys-22-1-2779","title":"A Neighborhood Combining Approach in GRASP's Local Search for Quadratic Assignment Problem Solutions","display_name":"A Neighborhood Combining Approach in GRASP's Local Search for Quadratic Assignment Problem Solutions","publication_year":2018,"publication_date":"2018-03-30","ids":{"openalex":"https://openalex.org/W2794497090","doi":"https://doi.org/10.13053/cys-22-1-2779","mag":"2794497090"},"language":"en","primary_location":{"id":"doi:10.13053/cys-22-1-2779","is_oa":false,"landing_page_url":"https://doi.org/10.13053/cys-22-1-2779","pdf_url":null,"source":{"id":"https://openalex.org/S61446325","display_name":"Computaci\u00f3n y Sistemas","issn_l":"1405-5546","issn":["1405-5546","2007-9737"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319599","host_organization_name":"National Polytechnic Institute","host_organization_lineage":["https://openalex.org/P4310319599"],"host_organization_lineage_names":["National Polytechnic Institute"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computaci\u00f3n y Sistemas","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/A5009766505","display_name":"Erika Granillo Mart\u00ednez","orcid":null},"institutions":[{"id":"https://openalex.org/I141467249","display_name":"Universidad Popular Aut\u00f3noma del Estado de Puebla","ror":"https://ror.org/00njxm476","country_code":"MX","type":"education","lineage":["https://openalex.org/I141467249"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Erika Granillo Martinez","raw_affiliation_strings":["Universidad Popular Aut\u00f3noma del Estado de Puebla, Departamento de Ingenier\u00edas y Tecnologias de la Informaci\u00f3n, Puebla, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Popular Aut\u00f3noma del Estado de Puebla, Departamento de Ingenier\u00edas y Tecnologias de la Informaci\u00f3n, Puebla, M\u00e9xico","institution_ids":["https://openalex.org/I141467249"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067007116","display_name":"Rogelio Gonz\u00e1lez Vel\u00e1zquez","orcid":null},"institutions":[{"id":"https://openalex.org/I721619","display_name":"Benem\u00e9rita Universidad Aut\u00f3noma de Puebla","ror":"https://ror.org/03p2z7827","country_code":"MX","type":"education","lineage":["https://openalex.org/I721619"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Rogelio Gonz\u00e1lez Vel\u00e1zquez","raw_affiliation_strings":["Benem\u00e9rita Universidad Aut\u00f3noma de Puebla, Facultad de Ciencias de la Computaci\u00f3n, Puebla, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Benem\u00e9rita Universidad Aut\u00f3noma de Puebla, Facultad de Ciencias de la Computaci\u00f3n, Puebla, M\u00e9xico","institution_ids":["https://openalex.org/I721619"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072651532","display_name":"Mar\u00eda Beatr\u00edz Bern\u00e1be Loranca","orcid":"https://orcid.org/0000-0003-3014-4139"},"institutions":[{"id":"https://openalex.org/I721619","display_name":"Benem\u00e9rita Universidad Aut\u00f3noma de Puebla","ror":"https://ror.org/03p2z7827","country_code":"MX","type":"education","lineage":["https://openalex.org/I721619"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Mar\u00eda Beatriz Bernab\u00e9 Loranca","raw_affiliation_strings":["Benem\u00e9rita Universidad Aut\u00f3noma de Puebla, Facultad de Ciencias de la Computaci\u00f3n, Puebla, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Benem\u00e9rita Universidad Aut\u00f3noma de Puebla, Facultad de Ciencias de la Computaci\u00f3n, Puebla, M\u00e9xico","institution_ids":["https://openalex.org/I721619"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102929294","display_name":"Jos\u00e9 Luis Mart\u00ednez Flores","orcid":"https://orcid.org/0000-0003-2986-469X"},"institutions":[{"id":"https://openalex.org/I141467249","display_name":"Universidad Popular Aut\u00f3noma del Estado de Puebla","ror":"https://ror.org/00njxm476","country_code":"MX","type":"education","lineage":["https://openalex.org/I141467249"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Luis Mart\u00ednez Flores","raw_affiliation_strings":["Universidad Popular Aut\u00f3noma del Estado de Puebla, Departamento de Ingenier\u00edas y Tecnologias de la Informaci\u00f3n, Puebla, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Popular Aut\u00f3noma del Estado de Puebla, Departamento de Ingenier\u00edas y Tecnologias de la Informaci\u00f3n, Puebla, M\u00e9xico","institution_ids":["https://openalex.org/I141467249"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03367959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.8972437977790833},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.7947932481765747},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.758040189743042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6584822535514832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5485551953315735},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5199557542800903},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5033838152885437},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.49954771995544434},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.45242252945899963},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44496867060661316},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4260013997554779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3676832318305969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33762529492378235}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.8972437977790833},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.7947932481765747},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.758040189743042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6584822535514832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5485551953315735},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5199557542800903},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5033838152885437},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.49954771995544434},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.45242252945899963},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44496867060661316},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4260013997554779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3676832318305969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33762529492378235},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.13053/cys-22-1-2779","is_oa":false,"landing_page_url":"https://doi.org/10.13053/cys-22-1-2779","pdf_url":null,"source":{"id":"https://openalex.org/S61446325","display_name":"Computaci\u00f3n y Sistemas","issn_l":"1405-5546","issn":["1405-5546","2007-9737"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319599","host_organization_name":"National Polytechnic Institute","host_organization_lineage":["https://openalex.org/P4310319599"],"host_organization_lineage_names":["National Polytechnic Institute"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computaci\u00f3n y Sistemas","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5099999904632568,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1672069823","https://openalex.org/W1983095015","https://openalex.org/W2004683681","https://openalex.org/W2074160096","https://openalex.org/W2084668687","https://openalex.org/W2108593798","https://openalex.org/W2134215165","https://openalex.org/W2155711470"],"related_works":["https://openalex.org/W26906372","https://openalex.org/W2063446209","https://openalex.org/W4294811694","https://openalex.org/W2055379348","https://openalex.org/W1536823221","https://openalex.org/W1571373126","https://openalex.org/W1504466495","https://openalex.org/W46882622","https://openalex.org/W2156087782","https://openalex.org/W2124562211"],"abstract_inverted_index":{"In":[0],"this":[1,81,119],"paper":[2,82],"we":[3],"describe":[4],"a":[5,25,61,103],"study":[6],"for":[7,102],"the":[8,13,22,37,42,50,53,57,64,70,74,84,87,94,115],"search":[9],"of":[10,12,24,49,52,72,80,86,89,105],"solutions":[11,39],"combinatorial":[14],"optimization":[15],"problem":[16],"Quadratic":[17],"Assignment":[18],"Problem":[19],"(QAP)":[20],"through":[21],"implementation":[23],"Greedy":[26],"Randomized":[27],"Adaptive":[28],"Procedure":[29],"Search":[30],"(GRASP)":[31],"and":[32,56],"have":[33],"been":[34],"compared":[35],"with":[36,63,69],"best":[38],"known":[40],"in":[41,47,93,109],"literature,":[43],"obtaining":[44],"robust":[45],"results":[46],"terms":[48],"value":[51],"objective":[54],"function":[55],"execution":[58],"time.":[59],"Also":[60],"comparison":[62],"ant":[65],"algorithm":[66,121],"is":[67,83,122],"presented":[68],"aim":[71],"comparing":[73],"meta-heuristic.":[75],"The":[76,98,111],"most":[77],"important":[78],"contribution":[79],"use":[85],"combination":[88],"different":[90],"neighborhood":[91],"structures":[92],"GRASP":[95],"improvement":[96],"phase.":[97],"experiment":[99],"was":[100],"performed":[101],"set":[104],"test":[106],"instances":[107],"available":[108],"QAPLIB.":[110],"QAP":[112],"belongs":[113],"to":[114],"Np-hard":[116],"class":[117],"whereby":[118],"approximation":[120],"implemented.":[123]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}