{"id":"https://openalex.org/W2138648026","doi":"https://doi.org/10.1109/ipdps.2009.5161126","title":"A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid","display_name":"A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2138648026","doi":"https://doi.org/10.1109/ipdps.2009.5161126","mag":"2138648026"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2009.5161126","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","raw_type":"proceedings-article"},"type":"preprint","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"]},{"id":"https://openalex.org/I4210149660","display_name":"Universit\u00e9 d'Oran 2","ror":"https://ror.org/04nz98c29","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210149660"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Lakhdar Loukil","raw_affiliation_strings":["Facult\u00e9 des Sciences D\u00e9partement dinformatique, Universit\u00e9 d'Oran, Algeria","Universit\u00e9 d'Oran, Facult\u00e9 des Sciences, D\u00e9partement d'informatique, BP 1524 El M'Naouer Oran, Alg\u00e9rie"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences D\u00e9partement dinformatique, Universit\u00e9 d'Oran, Algeria","institution_ids":["https://openalex.org/I137407579"]},{"raw_affiliation_string":"Universit\u00e9 d'Oran, Facult\u00e9 des Sciences, D\u00e9partement d'informatique, BP 1524 El M'Naouer Oran, Alg\u00e9rie","institution_ids":["https://openalex.org/I4210149660"]}]},{"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, Luxembourg","University of Luxembourg, Faculty of Sciences Technology and Communication, 6 rue de Coudenhove Kalergi, L-1359, Luxembour, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Sciences Technology and Communication, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]},{"raw_affiliation_string":"University of Luxembourg, Faculty of Sciences Technology and Communication, 6 rue de Coudenhove Kalergi, L-1359, Luxembour, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112866837","display_name":"Nouredine Melab","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/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 Futurs, Parc Scientifique de la Haute Borne, Villeneuve d'Ascq, France","INRIA Futurs, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Futurs, Parc Scientifique de la Haute Borne, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I4210138412"]},{"raw_affiliation_string":"INRIA Futurs, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France#TAB#","institution_ids":["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/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":"El-Ghazali Talbi","raw_affiliation_strings":["INRIA Futurs, Parc Scientifique de la Haute Borne, Villeneuve d'Ascq, France","INRIA Futurs, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Futurs, Parc Scientifique de la Haute Borne, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I4210138412"]},{"raw_affiliation_string":"INRIA Futurs, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d'Asq, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"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, Luxembourg","University of Luxembourg, Faculty of Sciences Technology and Communication, 6 rue de Coudenhove Kalergi, L-1359, Luxembour, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Sciences Technology and Communication, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]},{"raw_affiliation_string":"University of Luxembourg, Faculty of Sciences Technology and Communication, 6 rue de Coudenhove Kalergi, L-1359, Luxembour, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6288,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93488334,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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.9983000159263611,"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/simulated-annealing","display_name":"Simulated annealing","score":0.7506998181343079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7392202019691467},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6857813596725464},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6512203812599182},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6429416537284851},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5740392208099365},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.555327832698822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4999818801879883},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.46978867053985596},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.41555166244506836},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36183059215545654},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.22578465938568115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17719781398773193}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7506998181343079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7392202019691467},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6857813596725464},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6512203812599182},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6429416537284851},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5740392208099365},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.555327832698822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4999818801879883},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.46978867053985596},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.41555166244506836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36183059215545654},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.22578465938568115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17719781398773193},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2009.5161126","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00690480v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00690480","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":"IPDPS 2009. IEEE International Symposium on Parallel & Distributed Processing, May 2009, Rome, Italy. pp.10.1109/IPDPS.2009.5161126","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W58335057","https://openalex.org/W186803212","https://openalex.org/W1036195498","https://openalex.org/W1497256448","https://openalex.org/W1506821072","https://openalex.org/W1511318786","https://openalex.org/W1516301787","https://openalex.org/W1585573806","https://openalex.org/W1954746126","https://openalex.org/W1971700807","https://openalex.org/W1975234331","https://openalex.org/W1979142433","https://openalex.org/W1997357508","https://openalex.org/W2009832821","https://openalex.org/W2011039300","https://openalex.org/W2013551243","https://openalex.org/W2024060531","https://openalex.org/W2031052090","https://openalex.org/W2056760934","https://openalex.org/W2066335675","https://openalex.org/W2066883591","https://openalex.org/W2068163568","https://openalex.org/W2104977880","https://openalex.org/W2106961302","https://openalex.org/W2107709238","https://openalex.org/W2111364199","https://openalex.org/W2130561484","https://openalex.org/W2134954564","https://openalex.org/W2150834164","https://openalex.org/W2154061444","https://openalex.org/W2976664243","https://openalex.org/W4255486187","https://openalex.org/W6629610141","https://openalex.org/W6630449917","https://openalex.org/W6630530105","https://openalex.org/W6630838125"],"related_works":["https://openalex.org/W1937970425","https://openalex.org/W2092337239","https://openalex.org/W1585212810","https://openalex.org/W3086925744","https://openalex.org/W2353965122","https://openalex.org/W3002422634","https://openalex.org/W2001283270","https://openalex.org/W2139077307","https://openalex.org/W2152209591","https://openalex.org/W1978798413"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,88],"propose":[4],"a":[5,43,56],"parallel":[6,57],"hybrid":[7],"genetic":[8],"method":[9,115],"for":[10],"solving":[11],"Quadratic":[12],"3-dimensional":[13],"Assignment":[14],"Problem":[15],"(Q3AP).":[16],"This":[17],"problem":[18],"is":[19,30,38,55,116,130],"proved":[20],"to":[21,123],"be":[22],"computationally":[23],"NP-hard.":[24],"The":[25,35,52,109,118],"parallelism":[26],"in":[27,50,61,106],"our":[28,86],"algorithm":[29],"of":[31,45,59,96],"two":[32],"hierarchical":[33],"levels.":[34],"first":[36],"level":[37,54],"an":[39],"insular":[40],"model":[41],"where":[42],"number":[44],"GAs":[46],"(genetic":[47],"algorithms)":[48],"evolve":[49],"parallel.":[51],"second":[53],"transformation":[58],"individuals":[60],"each":[62],"GA.":[63],"Implementation":[64],"has":[65],"been":[66,75],"done":[67],"using":[68],"ParadisEO1":[69],"framework,":[70],"and":[71,98,127],"the":[72,79,99,107,114,124,128],"experiments":[73],"have":[74],"performed":[76],"on":[77],"GRID5000,":[78],"French":[80],"nation-wide":[81],"computational":[82],"grid.":[83],"To":[84],"evaluate":[85],"method,":[87],"used":[89],"three":[90],"benchmarks":[91],"derived":[92],"from":[93],"QAP":[94],"instances":[95],"QAPLIB":[97],"results":[100,111],"are":[101,121],"compared":[102],"with":[103],"those":[104],"reported":[105],"literature.":[108],"preliminary":[110],"show":[112],"that":[113],"promising.":[117],"obtained":[119],"solutions":[120],"close":[122],"optimal":[125],"values":[126],"execution":[129],"efficient.":[131]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}