{"id":"https://openalex.org/W2116735668","doi":"https://doi.org/10.1142/s0129054112400242","title":"PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID","display_name":"PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2116735668","doi":"https://doi.org/10.1142/s0129054112400242","mag":"2116735668"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112400242","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400242","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5006080224","display_name":"Lakhdar Loukil","orcid":null},"institutions":[{"id":"https://openalex.org/I137407579","display_name":"Universit\u00e9 Oran 1 Ahmed Ben Bella","ror":"https://ror.org/059et2b68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I137407579"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"LAKHDAR LOUKIL","raw_affiliation_strings":["Faculty of Sciences, University of Oran, BP. 1524 El M'Naouer, Oran, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, University of Oran, BP. 1524 El M'Naouer, Oran, Algeria","institution_ids":["https://openalex.org/I137407579"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113708631","display_name":"Malika Mehdi","orcid":null},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"MALIKA MEHDI","raw_affiliation_strings":["Faculty of Sciences, Technology and Communication, University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, Technology and Communication, University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106483208","display_name":"Nouredine Melab","orcid":"https://orcid.org/0000-0003-1526-006X"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre Inria de l'Universit\u00e9 de Lille","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"NOUREDINE MELAB","raw_affiliation_strings":["INRIA Lille - Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Lille - Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107857046","display_name":"El\u2010Ghazali Talbi","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I28022161","display_name":"King Saud University","ror":"https://ror.org/02f81g417","country_code":"SA","type":"education","lineage":["https://openalex.org/I28022161"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre Inria de l'Universit\u00e9 de Lille","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["FR","SA"],"is_corresponding":false,"raw_author_name":"EL-GHAZALI TALBI","raw_affiliation_strings":["INRIA Lille - Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France","King Saud University, Riyadh, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Lille - Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"King Saud University, Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I28022161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058311932","display_name":"Pascal Bouvry","orcid":"https://orcid.org/0000-0001-9338-2834"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"PASCAL BOUVRY","raw_affiliation_strings":["Faculty of Sciences, Technology and Communication, University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, Technology and Communication, University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3887,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85124461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"02","first_page":"483","last_page":"500"},"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.9980000257492065,"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.9980000257492065,"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.9926999807357788,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9922999739646912,"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/computer-science","display_name":"Computer science","score":0.6779287457466125},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.6043207049369812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.568357527256012},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5442122220993042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5264996886253357},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5006511211395264},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4942474663257599},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4767400026321411},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4683277904987335},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.41495048999786377},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3956909477710724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.269622802734375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779287457466125},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.6043207049369812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.568357527256012},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5442122220993042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5264996886253357},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5006511211395264},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4942474663257599},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4767400026321411},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4683277904987335},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.41495048999786377},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3956909477710724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.269622802734375},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054112400242","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400242","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00750703v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00750703","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 2012, 23 (2), pp.483-500. ⟨10.1142/S0129054112400242⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1954746126","https://openalex.org/W1971700807","https://openalex.org/W1979142433","https://openalex.org/W1997357508","https://openalex.org/W2009832821","https://openalex.org/W2013551243","https://openalex.org/W2031052090","https://openalex.org/W2066883591","https://openalex.org/W2068163568","https://openalex.org/W2070223281","https://openalex.org/W2084512390","https://openalex.org/W2107709238","https://openalex.org/W2111364199","https://openalex.org/W2113135226","https://openalex.org/W2130561484","https://openalex.org/W2150834164","https://openalex.org/W2739965732","https://openalex.org/W3121235808","https://openalex.org/W4255486187"],"related_works":["https://openalex.org/W4321504838","https://openalex.org/W2794855054","https://openalex.org/W2081475278","https://openalex.org/W2005169299","https://openalex.org/W2606087467","https://openalex.org/W1540477665","https://openalex.org/W150166259","https://openalex.org/W2314520391","https://openalex.org/W2085776465","https://openalex.org/W3087663609"],"abstract_inverted_index":{"This":[0,54],"paper":[1],"deals":[2],"with":[3,199],"the":[4,7,22,30,64,105,121,178,185,203,208],"resolution":[5],"of":[6,21,29,81,129,144,165],"Quadratic":[8,24],"3-dimensional":[9],"Assignment":[10,25],"Problem":[11,26,33],"hereafter":[12],"referred":[13],"to":[14,70,99],"as":[15,61],"Q3AP.":[16,122],"Q3AP":[17,66,76],"is":[18,56,72,128,136,161],"an":[19,137],"extension":[20],"well-known":[23],"(QAP)":[27],"and":[28,153,177],"Axial":[31],"3-Assignment":[32],"(A3AP).":[34],"It":[35],"finds":[36],"its":[37],"application":[38],"amongst":[39],"others":[40],"in":[41,50,125,167,202,217],"Hybrid":[42],"Automatic":[43],"Repeat":[44],"reQuest":[45],"(HARQ)":[46],"error-control":[47],"mechanism":[48],"used":[49],"wireless":[51],"communication":[52],"systems.":[53],"problem":[55],"computationally":[57],"NP-hard.":[58],"As":[59],"far":[60,211],"we":[62,113],"know,":[63],"largest":[65],"instance":[67,77],"size":[68,78,102],"solved":[69],"optimality":[71],"13":[73],"whereas":[74],"practical":[75],"can":[79],"be":[80],"8,":[82],"16,":[83],"32":[84],"or":[85,92,207],"64.":[86],"Sequential":[87],"exact":[88],"methods":[89,127],"such":[90],"branch-and-bound":[91],"sequential":[93],"metaheuristics":[94,118],"are":[95],"therefore":[96],"not":[97],"suited":[98],"solve":[100],"large":[101],"instances":[103],"for":[104,119],"excessive":[106],"needed":[107],"computation":[108,220],"time.":[109,221],"In":[110],"this":[111],"paper,":[112],"propose":[114],"parallel":[115,163],"hybrid":[116],"genetic-based":[117],"solving":[120],"The":[123,133,158,190,205],"parallelism":[124],"our":[126,195],"two":[130],"hierarchical":[131],"levels.":[132],"first":[134],"level":[135,160],"insular":[138],"model":[139],"where":[140],"a":[141,162,218],"fixed":[142],"number":[143],"genetic":[145,156],"algorithms":[146],"(GA)":[147],"evolve":[148],"independently":[149],"on":[150,183],"separate":[151],"islands":[152],"periodically":[154],"exchange":[155],"material.":[157],"second":[159],"transformation":[164],"individuals":[166],"each":[168],"GA.":[169],"Implementation":[170],"has":[171],"been":[172,181,215],"done":[173],"using":[174],"ParadisEO":[175],"framework,":[176],"experiments":[179],"have":[180,214],"performed":[182],"GRID5000,":[184],"French":[186],"nation-wide":[187],"computational":[188],"grid.":[189],"experimental":[191],"results":[192],"produced":[193],"by":[194],"method":[196],"were":[197],"confronted":[198],"those":[200],"reported":[201],"literature.":[204],"optimum":[206],"best":[209],"so":[210],"known":[212],"solutions":[213],"reached":[216],"reasonable":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}